The two main kinds of heuristic search method, mountain climbing method and best first search method, mountain climbing search efficiency to slightly higher, but stability and search results as best first search method, hill climbing method it is easy to fall into local extreme point.
Corresponding, the termination condition is the best first search method is the default termination condition: if continuous t (t is given in advance of a parameter) of the previous optimal attributes subset expansion did not further improve the highest classification accuracy, the search process is over.
This paper is therefore limited to comparing the implementations of the popular AI algorithms, namely Breadth First Search, Depth First Search, A*, Best First Search and Hill climbing algorithms for solving a sliding n-puzzle in an attempt to look at the better efficient of the algorithms for this case.
all presented summary of results from a parallel best first search of state-space graphs .
Blai Bonet and Hector Geffner study a family of heuristic planners , applying them in the context of Hill Climbing and Best First search algorithms and tested on a number of domains to analyse the best planners and the reasons why they do well.
This paper attempts to demonstrate the implementation of Breadth First Search, Depth First Search, A*, Best First Search and Hill Climbing algorithms for solving a sizeable sliding puzzle and for solving an 8 queen puzzle.