Talk:Maze-solving algorithm

Random mouse algorithm

It is incorrect that random mouse algorithm "will always eventually find the solution". In most cases such algorithm would trap the mouse indefinitely in a section the only exit from which is in the middle of the wall. I would suggest changing the wording to smth along the lines of "may eventually find the solution". --Louigi Verona (talk) 10:05, 10 October 2011 (UTC)[reply]

The Random Mouse algorithm as currently described will never trap the solver so that it can't reach the exit. It proceeds until a junction is reached, meaning if it's on a straightaway and there's a path off to the side, it will stop and potentially take the side passage. The Random Mouse will not necessarily pass all side passages until it rams into a wall. (If it did do that, then it could indeed get trapped, for example in a passage shaped like a capital "T", with the two sides being dead ends and the base of the "T" being the only way out, where the solver would go back and forth across the top of the "T" forever.) This means Random Mouse will eventually solve any standard Maze, although it may take arbitrarily long to do so if it keeps getting bad luck with the randomly chosen passages. Thanks, - Cruiser1 (talk) 04:14, 12 October 2011 (UTC)[reply]

Trémaux

The description auf the Trémaux algorithm is incomplete. It does not work. The original rules by Trémaux. -- RTH (talk) 15:49, 24 April 2009 (UTC)[reply]

Corrected --Ein student (talk) 17:44, 12 March 2010 (UTC)[reply]

Maze blog

It was an ad page. Searched for similar blog, but someone else may find a better one. —Preceding unsigned comment added by 62.47.162.12 (talk) 07:11, 26 July 2010 (UTC)[reply]

Solution vs Traversal

This article refers to both solution and traversal. To my mind, solution simply involves finding a route from the start to the finish but does not necessarily find the best solution and will probably not find every branch. Traversal finds a complete description of the maze, including all branches. This distinction should be mentioned. treesmill (talk) 21:43, 16 May 2011 (UTC)[reply]

Maze with two solutions

The example Maze with two solutions seems way to complicated. What it it's purpose? If it's just there to show a maze with two solutions then a smaller simpler maze would be better. Currently it's just an example of a large maze because any details are lost. How can I even verify it has only two solutions? It leads me to come to the conclusion that all mazes with two solutions must be very large, although I know this isn't the case. -87.114.252.206 (talk) 01:03, 29 May 2013 (UTC)[reply]

One-way door mazes

The most interesting of all mazes, IMO, is mazes with one-way doors. This is not a complication for a computer, in that it can efficiently find solutions for such mazes. However, a person in such a maze finds themselves in a far more challenging situation than when in a similar sized traditional maze. A simple chain of N rooms with one door forward and one leading back to the start will cause a child running randomly to have to go through an expected 2^N doors before getting out. Even with a map, such a maze takes O(N^2) transitions. I've come up with a solution and posted an implementation in C on github. I hope that since I can find no other algorithms described for one-way door mazes that the section I added can stay, though it clearly can be improved.WaywardGeek (talk) 18:56, 20 June 2013 (UTC)[reply]