Content deleted Content added
→Random mouse algorithm: terminatino issue |
|||
Line 4:
== 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 in a straight line until a junction is reached, and then to make a random decision about the next direction to follow. Although theoretically such a method would always [[Las Vegas algorithm|eventually find the right solution]], it is also possible that it [[Termination analysis|never finds any solution]]. Because the random mouse might walk any path multiple times it is extremely slow.
== Wall follower ==
| |||