Maze algorithm is an important part of the computer algorithm. The construction of the maze by human beings has a history of 5000 years. So far, the long-exiting mazes are still hot issues for people. Such famous mazes include that on the island of Crete on Aegean Sea, the labyrinth of the Minotaur meters, the Scandinavian maze-the Fortress of Troy, etc. There are maze algorithms such as Recursive Algorithms, the Shortest Path, Exhaustive Method, Random Mouse, Wall Follower, Pledge Algorithm, Chain Algori- thm, Recursive Backtracker, Tremaux's Algorithm, Collision Solver, Shortest Paths Finder, Shortest Path Finder, etc. This paper utilizes these algorithms, reversing from each dead-end of maze and finally finds out the optimistic route for the maze.