Editing Maze (section)

==Solution==
{{Main|Maze solving algorithm}}
Maze solving is the act of finding a route through the maze from the start to finish. Some maze solving methods are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas others are designed to be used by a person or computer program that can see the whole maze at once.

The [[mathematician]] [[Leonhard Euler]] was one of the first to analyze plane mazes mathematically, and in doing so made the first significant contributions to the branch of mathematics known as [[topology]].{{citation needed|date=March 2024}}

Mazes containing no loops are known as "standard", or "perfect" mazes, and are equivalent to a [[Tree (graph theory)|''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.<ref>[https://www.youtube.com/watch?v=k1tSK5V1pds Maze to Tree] {{webarchive|url=https://web.archive.org/web/20160412011142/https://www.youtube.com/watch?v=k1tSK5V1pds |date=12 April 2016 }}. YouTube (23 December 2007). Retrieved on 18 June 2011.</ref>