Jump to content

Talk:Maze-solving algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Louigi Verona (talk | contribs) at 10:05, 10 October 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

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]