Maze Solving Algorithm
There are a number of different maze solving algorithms, that is, automated methods for the solving of mazes. The random mouse, wall follower, Pledge, and Trémaux 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.
Mazes containing no loops are known as "standard", or "perfect" mazes, and are equivalent to a tree in graph theory. Thus many maze solving algorithms are closely related to graph theory. Intuitively, if one pulled and stretched out the paths in the maze in the proper way, the result could be made to resemble a tree.
Read more about Maze Solving Algorithm: Random Mouse Algorithm, Wall Follower, Pledge Algorithm, Trémaux's Algorithm, Dead-end Filling, Shortest Path Algorithm, Mazes With One-way Doors, See Also
Famous quotes containing the words maze and/or solving:
“Society bristles with enigmas which look hard to solve. It is a perfect maze of intrigue.”
—Honoré De Balzac (1799–1850)
“Certainly, young children can begin to practice making letters and numbers and solving problems, but this should be done without workbooks. Young children need to learn initiative, autonomy, industry, and competence before they learn that answers can be right or wrong.”
—David Elkind (20th century)