Here is the file containing the map: 300Node.txt
VERBOSE= Off for sure!
Here we go, copied from my console:
Breadth First
z=Searcher('BREADTH','300Node.txt', hNull,False)
Loaded search type BREADTH with map in file: 300Node.txt
z.setStartGoal('DG','GR')
z.go()
BREADTH search: from DG to ['GR']
------------------------
SEARCH SUMMARY STATS:
Search Type: BREADTH. Map file: 300Node.txt Total Nodes in Graph:300
Start node: DG ; Goal node(s): ['GR']
Searched total of 296 nodes out of total of 300 in graph
Ended at Node: GR with path cost: 3501
Path (13): ['DG', 'CM', 'EL', 'JW', 'KC', 'KA', 'KN', 'HS', 'JP', 'IF', 'JR', 'IZ', 'GR']
Frontier size: Average= 27.20 ; Max size= 38
Depth of search: Average= 7.00 ; Max Depth= 12
Average branching factor= 5.30
Depth First
DEPTH search: from DG to ['GR']
------------------------
SEARCH SUMMARY STATS:
Search Type: DEPTH. Map file: 300Node.txt Total Nodes in Graph:300
Start node: DG ; Goal node(s): ['GR']
Searched total of 209 nodes out of total of 300 in graph
Ended at Node: GR with path cost: 14467
Path (160): ['DG', 'BF', 'DC', 'AT', 'AJ', 'DV', 'AS', 'AP', 'BM', 'BI', 'AB', 'A', 'BV', 'DI', 'AA', 'EI', 'BJ', 'DB', 'HK', 'CN', 'DS', 'IX', 'ET', 'GS', 'EH', 'FS', 'DJ', 'DT', 'ED', 'CZ', 'CU', 'BK', 'AI', 'AK', 'CB', 'AN', 'DM', 'BR', 'AV', 'AF', 'CX', 'CW', 'AR', 'AL', 'AX', 'AM', 'BS', 'CG', 'AE', 'B', 'BL', 'CQ', 'BC', 'BH', 'FQ', 'DO', 'DD', 'AQ', 'CT', 'AG', 'BT', 'BD', 'CK', 'CS', 'CF', 'BA', 'AO', 'BZ', 'AW', 'DX', 'FX', 'FJ', 'AU', 'AC', 'EU', 'FE', 'GF', 'GP', 'ER', 'CD', 'FP', 'DN', 'CM', 'EL', 'FC', 'EA', 'BE', 'CR', 'GQ', 'IL', 'GC', 'HD', 'GT', 'EM', 'FI', 'EE', 'GX', 'KI', 'EW', 'CJ', 'FU', 'HH', 'EX', 'FB', 'HI', 'FG', 'DY', 'BW', 'CE', 'BP', 'AH', 'BY', 'CL', 'GH', 'CO', 'CV', 'GD', 'CC', 'BB', 'AZ', 'CA', 'FL', 'DP', 'EO', 'DF', 'FF', 'HL', 'HJ', 'GL', 'IC', 'HW', 'HF', 'IW', 'HS', 'DK', 'HY', 'GW', 'EG', 'HP', 'EK', 'II', 'JP', 'GM', 'EN', 'GA', 'DQ', 'ES', 'FH', 'DR', 'FA', 'FK', 'EY', 'EZ', 'HN', 'IF', 'HX', 'JD', 'JN', 'FY', 'GR']
Frontier size: Average= 60.22 ; Max size= 93
Depth of search: Average= 81.26 ; Max Depth= 159
Average branching factor= 5.36
Best First
Loaded search type BEST with map in file: 300Node.txt
z.setStartGoal('DG','GR')
z.go()
BEST search: from DG to ['GR']
------------------------
SEARCH SUMMARY STATS:
Search Type: BEST. Map file: 300Node.txt Total Nodes in Graph:300
Start node: DG ; Goal node(s): ['GR']
Searched total of 283 nodes out of total of 300 in graph
Ended at Node: GR with path cost: 1041
Path (16): ['DG', 'BF', 'FQ', 'BH', 'V', 'AP', 'BO', 'H', 'BR', 'CI', 'AD', 'BG', 'IG', 'BY', 'GH', 'GR']
Frontier size: Average= 24.89 ; Max size= 33
Depth of search: Average= 8.33 ; Max Depth= 16
Average branching factor= 5.30
A* with SLD heuristic
z=Searcher('A*','300Node.txt', hSLD,False)
Loaded search type A* with map in file: 300Node.txt
z.setStartGoal('DG','GR')
z.go()
A* search: from DG to ['GR']
------------------------
SEARCH SUMMARY STATS:
Search Type: A*. Map file: 300Node.txt Total Nodes in Graph:300
Using h-function:<function hSLD at 0x1148cc8c8>
Start node: DG ; Goal node(s): ['GR']
Searched total of 53 nodes out of total of 300 in graph
Ended at Node: GR with path cost: 1069
Path (18): ['DG', 'BF', 'FQ', 'AJ', 'DV', 'AS', 'BM', 'I', 'AN', 'L', 'CI', 'AD', 'HB', 'BP', 'KM', 'DL', 'IZ', 'GR']
Frontier size: Average= 26.74 ; Max size= 40
Depth of search: Average= 7.70 ; Max Depth= 17
Average branching factor= 5.23