Here is the file containing the map: 30Node.txt
VERBOSE= Off for sure!
Here we go, copied from my console:
Breadth First
Python 3.6.0 (v3.6.0:41df79263a11, Dec 22 2016, 17:23:13)
[GCC 4.2.1 (Apple Inc. build 5666) (dot 3)] on darwin
z=Searcher('BREADTH','30Node.txt', hNull,False)
Loaded search type BREADTH with map in file: 30Node.txt
z.setStartGoal('AB','V')
z.go()
BREADTH search: from AB to ['V']
------------------------
SEARCH SUMMARY STATS:
Search Type: BREADTH. Map file: 30Node.txt Total Nodes in Graph:30
Start node: AB ; Goal node(s): ['V']
Searched total of 26 nodes out of total of 30 in graph
Ended at Node: V with path cost: 1021
Path (7): ['AB', 'N', 'AA', 'B', 'AE', 'W', 'V']
Frontier size: Average= 4.58 ; Max size= 7
Depth of search: Average= 3.38 ; Max Depth= 6
Average branching factor= 3.69
Depth First
DEPTH search: from AB to ['V']
------------------------
SEARCH SUMMARY STATS:
Search Type: DEPTH. Map file: 30Node.txt Total Nodes in Graph:30
Start node: AB ; Goal node(s): ['V']
Searched total of 12 nodes out of total of 30 in graph
Ended at Node: V with path cost: 1947
Path (11): ['AB', 'N', 'AA', 'B', 'AC', 'D', 'E', 'O', 'L', 'AD', 'V']
Frontier size: Average= 4.83 ; Max size= 8
Depth of search: Average= 5.17 ; Max Depth= 10
Average branching factor= 3.33
Best First
BEST search: from AB to ['V']
------------------------
SEARCH SUMMARY STATS:
Search Type: BEST. Map file: 30Node.txt Total Nodes in Graph:30
Start node: AB ; Goal node(s): ['V']
Searched total of 29 nodes out of total of 30 in graph
Ended at Node: V with path cost: 958
Path (9): ['AB', 'N', 'AA', 'T', 'F', 'J', 'C', 'U', 'V']
Frontier size: Average= 4.69 ; Max size= 8
Depth of search: Average= 4.28 ; Max Depth= 8
Average branching factor= 3.59
A* with SLD heuristic
z=Searcher('A*','30Node.txt', hSLD,False)
Loaded search type A* with map in file: 30Node.txt
z.setStartGoal('AB','V')
z.go()
A* search: from AB to ['V']
------------------------
SEARCH SUMMARY STATS:
Search Type: A*. Map file: 30Node.txt Total Nodes in Graph:30
Using h-function:<function hSLD at 0x1148cc8c8>
Start node: AB ; Goal node(s): ['V']
Searched total of 10 nodes out of total of 30 in graph
Ended at Node: V with path cost: 1021
Path (7): ['AB', 'N', 'AA', 'B', 'AE', 'W', 'V']
Frontier size: Average= 4.60 ; Max size= 8
Depth of search: Average= 2.90 ; Max Depth= 6
Average branching factor= 3.70