A maze-solving algorithm is an automated method for solving a maze. The random mouse, wall follower, Pledge, Tarry's, and Trémaux's algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas the dead-end filling and shortest path algorithms are designed to be used by a person or computer program that can see the whole maze at once.
A maze-solving algorithm is an automated method for solving a maze. The random mouse, wall follower, Pledge, Tarry's, and Trémaux's algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas the dead-end filling and shortest path algorithms are designed to be used by a person or computer program that can see the whole maze at once.
Source: Wikipedia "Maze-solving algorithm" · CC BY-SA 4.0
Share this article: X · Bluesky