New Algorithm for Solving Shortest Path of Maze Problem
Junfeng Qu · Computer Engineering and Applications Journal · 2006
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).By appropriate conversion,the algorithm changes the original problem into the creation of the maze graph problem.At last,an example is given,which shows that the new algorithm is easy to be understood and programmed as well as its low time and space complexity.