Application of a kind of A* algorithm to solve maze puzzle
Abstract
The heuristic search algorithm names A-star also known as the best map search algorithm. When the A algorithm in the evaluation function, use the inspiration function h(n) is in h* (n) the lower bound of the (h*(n) from the target node of the actual dissipation value), is to satisfy h(n)≤h*(n), this method known as A*algorithms. It is in fact a branch of boundaries and dynamic planning and the algorithm by using lower bound of combining the functions h. In this paper, a new algorithm is presented for solving the shortest path of maze problem, which is not based on the inefficient recursive backtracking theory of classical algorithm （DFS－Depth First Search and BFS—Breadth First Search）.we will use A-star algorithm to solve the general maze of path.
