Performance comparison of search algorithms based on eight puzzle problem

The essential of search algorithrns is the establishment of search strategies.Traditional search algorithms use strategies without information guidance,such as the depth-first search(DFS)and the breadth-first search(BFS).Modern search algorithms use strategies with the guidance of information,which are called heuristic search algorithms,e.g.the A~* algorithm,different search strategies will make the performance of the algorithms varies considerably.With the using of DFS,BFS and A~* algorithm to solve the eight puzzle problem,the performance of these algorithms is analyzed,and simultaneously indicates the feature of them,while at last show the analytic conclusion on the purpose of giving the direction to develop and use more efficient search strategies.