print "\n******** STATISTICS *********"
print "Final cost: "+ str(final_cost)
if __name__ == "__main__":
search_strategy = int(raw_input("Search algorithm? (BFS = 0, DFS = 1, DLS = 2, IDS = 3, UC = 4, AStar = 5)\n"))
if not search_strategy in range(6):
print("Invalid search algorithm. Exiting...")
sys.exit(0)
prune = raw_input("Execute prune? (Y/N)\n")
print "Looking for nodes " + str(sys.argv[6:])
initial_state = State(Node_Map(sys.argv[1]), sys.argv[6:])
boundary_coordinates = (sys.argv[2], sys.argv[3], sys.argv[4], sys.argv[5])
problem = Problem(State_Space(boundary_coordinates), initial_state)
problem.build_hash_table()
timestamp1 = datetime.datetime.now()
path = search(problem, search_strategy)
print "Time taken to accomplish the search: " + str(datetime.datetime.now() - timestamp1)
global number_of_generated_nodes
print "Number of generated nodes: " + str(number_of_generated_nodes)
sys.exit(0)
if __name__ == "__main__":
search_strategy = int(
raw_input(
"Search algorithm? (BFS = 0, DFS = 1, DLS = 2, IDS = 3, UC = 4, AStar = 5)\n"
))
if not search_strategy in range(6):
print("Invalid search algorithm. Exiting...")
sys.exit(0)
prune = raw_input("Execute prune? (Y/N)\n")
print "Looking for nodes " + str(sys.argv[6:])
initial_state = State(Node_Map(sys.argv[1]), sys.argv[6:])
boundary_coordinates = (sys.argv[2], sys.argv[3], sys.argv[4], sys.argv[5])
problem = Problem(State_Space(boundary_coordinates), initial_state)
problem.build_hash_table()
timestamp1 = datetime.datetime.now()
path = search(problem, search_strategy)
print "Time taken to accomplish the search: " + str(
datetime.datetime.now() - timestamp1)
global number_of_generated_nodes
print "Number of generated nodes: " + str(number_of_generated_nodes)
sys.exit(0)
if len(sys.argv) < 7:
print(__doc__.format(__file__))
sys.exit(0)
if __name__ == "__main__":
print "Looking for nodes " + str(sys.argv[6:])
initial_state = State(Node_Map(sys.argv[1]), sys.argv[6:])
boundary_coordinates = (sys.argv[2], sys.argv[3], sys.argv[4], sys.argv[5])
p = Problem(State_Space(boundary_coordinates), initial_state)
p.build_hash_table()
path = p.search(Searching_Strategies.BFS)
if len(path)==0:
print "Path not found"
sys.exit(0)
print "Path found! Path saved in data/solution.out"
sys.stdout = open('data/solution.out','w')
print "Final path to " + str(sys.argv[6:])
while (len(path)>0):
print path.pop()
from State_Space import State_Space
from Problem import Problem
from auxiliary_functions import Searching_Strategies
import sys
if len(sys.argv) < 7:
print(__doc__.format(__file__))
sys.exit(0)
if __name__ == "__main__":
print "Looking for nodes " + str(sys.argv[6:])
initial_state = State(Node_Map(sys.argv[1]), sys.argv[6:])
boundary_coordinates = (sys.argv[2], sys.argv[3], sys.argv[4], sys.argv[5])
p = Problem(State_Space(boundary_coordinates), initial_state)
p.build_hash_table()
path = p.search(Searching_Strategies.BFS)
if len(path) == 0:
print "Path not found"
sys.exit(0)
print "Path found! Path saved in data/solution.out"
sys.stdout = open('data/solution.out', 'w')
print "Final path to " + str(sys.argv[6:])
while (len(path) > 0):
print path.pop()
