Searching algorithms implementation and comparison of Eight-puzzle problem

Abstract

Eight-puzzle Problem is a one of classic difficulty problem in Artificial Intelligence, to solve this problem in most cases are adopted the search algorithm, and Search strategy is one of the main directions in the artificial intelligence research. Using different search strategies in the process of solving problem also may have differences. In this paper, through the analysis of the search solution for the Eight-puzzle Problem, the Breadth-first search algorithm, the Depth-first search algorithm, and A*algorithm, which is one of the heuristic search, are used to implement it. These algorithms are compared to evaluate the superiority between these three search algorithms, and at last drew the analytic conclusion on the purpose of giving the direction to develop and use more efficient search strategies. In general, heuristic search algorithms are more convenient and efficient than blinding algorithms in the states space search.