-
Notifications
You must be signed in to change notification settings - Fork 2
/
sample_run.py
43 lines (29 loc) · 1.67 KB
/
sample_run.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
import subprocess
import sys
command = sys.executable + " search.py input_files/ortho.txt {} {} {}"
# Tree Search with DFS
subprocess.call(command.format('tree-search', 'dfs', ''), shell=True)
# Tree Search with BFS
subprocess.call(command.format('tree-search', 'bfs', ''), shell=True)
# Graph Search with BFS
subprocess.call(command.format('graph-search', 'bfs', ''), shell=True)
# Graph Search with BFS with symmetry check
subprocess.call(command.format('symmetry', 'bfs', ''), shell=True)
# Graph Search with A* using max_movable_pegs
subprocess.call(command.format('graph-search', 'astar', 'max_movable_pegs'), shell=True)
# Graph Search with A* using max_movable_pegs with symmetry check
subprocess.call(command.format('symmetry', 'astar', 'max_movable_pegs'), shell=True)
# Graph Search with A* using max_moves
subprocess.call(command.format('graph-search', 'astar', 'max_moves'), shell=True)
# Graph Search with A* using max_moves with symmetry check
subprocess.call(command.format('symmetry', 'astar', 'max_moves'), shell=True)
# Graph Search with A* using min_moves
subprocess.call(command.format('graph-search', 'astar', 'min_moves'), shell=True)
# Graph Search with A* using min_moves with symmetry check
subprocess.call(command.format('symmetry', 'astar', 'min_moves'), shell=True)
# Graph Search with A* using manhattan_distance
subprocess.call(command.format('graph-search', 'astar', 'man'), shell=True)
# Graph Search with A* using manhattan_distance with symmetry check
subprocess.call(command.format('symmetry', 'astar', 'man'), shell=True)
# Tree Search with IDA* using any of the three heuristics
subprocess.call(command.format('tree-search', 'idastar', 'min_moves'), shell=True)