Maze-solving algorithm: Difference between revisions

Revision as of 21:01, 26 December 2016

Revision as of 15:31, 3 January 2017

Line 5:

== Random mouse algorithm ==

This is a trivial method that can be implemented by a very unintelligent [[robot]] or perhaps a mouse. It is simply to proceed following the current passage until a junction is reached, and then to make a random decision about the next direction to follow. Although such a method would always [[Las Vegas algorithm|eventually find the right solution]], this algorithm canwill be extremely slow.

== Wall follower ==