Maze-Solving Algorithm

A maze-solving algorithm is an automated method for finding a way through a maze. Some methods, such as the random mouse algorithm, the wall follower, the Pledge algorithm, Tarry's algorithm and Tremaux's algorithm, are designed for a traveler with no advance knowledge of the maze layout. Others, including dead-end filling and shortest-path algorithms, assume an observer who can see the whole maze at once. Maze-solving algorithms are closely related to graph theory, since a simply connected maze with no loops is structurally equivalent to a tree. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/