Content deleted Content added
→Trémaux's algorithm: rewrite case to work correctly for the start config |
→Trémaux's algorithm: Changed diagram to one that follows algorithm more clearly (the markings at the intersection are clearer and there is no continuous path) |
||
Line 30:
== Trémaux's algorithm ==
[[File:Tremaux Maze
Trémaux's algorithm, invented by [[Charles Pierre Trémaux]],<ref>Public conference, December 2, 2010 – by professor [[Jean Pelletier-Thibert]] in Academie de Macon (Burgundy – France) – (Abstract published in the Annals academic, March 2011 – {{ISSN|0980-6032}}) <br/>Charles Tremaux (° 1859 – † 1882) Ecole Polytechnique of Paris (X:1876), French engineer of the telegraph</ref> is an efficient method to find the way out of a maze that requires drawing lines on the floor to mark a path, and is guaranteed to work for all mazes that have well-defined passages.<ref name="Récréations Mathématiques">Édouard Lucas: ''Récréations Mathématiques'' Volume I, 1882.</ref>
A path from a junction is either unvisited, marked once or marked twice. The algorithm works according to the following rules:
| |||