Maze-solving algorithm: Difference between revisions

Revision as of 21:04, 28 September 2016

Revision as of 18:33, 29 September 2016

Line 19:

== Pledge algorithm ==

[[File:Pledge Algorithm.png|left|thumb| Left: Left-handNormal solver trapped <br /> Right: Pledge algorithm solution]]

[[File:Cyclope robot.jpg|thumb|right|Robot in a wooden maze]]

Disjoint mazes can still be solved with the wall follower method, if the entrance and exit to the maze are on the outer walls of the maze. If however, the solver starts inside the maze, it might be on a section disjoint from the exit, and wall followers will continually go around their ring. The Pledge algorithm (named after [[Jon Pledge]] of [[Exeter]]) can solve this problem.<ref>{{citation|title=Turtle Geometry: the computer as a medium for exploring mathematics|last1=Abelson|last2=diSessa|year=1980}}</ref><ref>Seymour Papert, [ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-298.pdf "Uses of Technology to Enhance Education"], ''MIT Artificial Intelligence Memo No. 298'', June 1973</ref>