Solution of Puzzle Problem Using Genetic Algorithm
Yuanxiang Li · Jisuanji gongcheng · 2003
Characterized by large search space, Puzzle problem is often used in AI research to test the performance of kinds of searching algorithms. For 24 Puzzle problem as example, it often takes at least 2.25 h to find the optimal solution even using the available best heuristic searching algorithm. As so far, genetic algorithm (GA) has seldom been seen to find its application in solving such a kind of problem. As an easy-of-use and robust searching algorithm, GA is highly fitted for solving the searching problem that has large and complex searching space. In this paper, a kind of genetic algorithm is designed to solve the puzzle problem. To avoid traditional GAs premature convergence problem, some modifications are made. Experiments on 15 and 24 Puzzle problem show that this algorithm can reach satisfying optimal solutions in much less time, which proves its validity and efficiency.