Maze Problem's Solution Based on Marking Path Location Method
Based on the method of marking location to search and the matrix representation to said a maze, proposes a simple algorithm to solve complex maze path. The algorithm can obtain the shortest distance of the maze from entrance to exit, and can get more meaningful infor-mation by increasing sort.
Mark LocationMatrix RepresentationMazePath Solution
NETL
NSTL
万方数据
维普
