Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: finite maze solving algorithm
Replies: 9   Last Post: Dec 3, 2004 7:09 AM

 Messages: [ Previous | Next ]
 Keith A. Lewis Posts: 113 Registered: 12/10/04
Re: finite maze solving algorithm
Posted: Nov 30, 2004 2:25 PM

Kevin Saff &lt;news@kevin.saff.net&gt; writes in article &lt;I808DL.GF2@news.boeing.com&gt; dated Tue, 30 Nov 2004 18:22:32 GMT:
&gt;Michael Michalchik wrote:
&gt;&gt; I was wondering if anyone knows if all possible topologies of finite
&gt;&gt; 2d mazes can be solved by a finite algorithm. For example, we know
&gt;&gt; that all fully connected mazes can be solved by picking a wall and
&gt;&gt; exhaustively following it. Can a general solution work for all mazes
&gt;&gt; including the ones that are piecewise disconnected? If this is
&gt;&gt; possible, is the general solution a solved problem?
&gt;
&gt;Interesting. How are you defining a maze, here? Usually, I think of a
&gt;maze as just a graph, which you can solve using something simple like
&gt;depth-first search, regardless of whether it is planar. It is probably
&gt;better to think in terms of connectedness of rooms than connectedness of
&gt;walls.

The basic problem with a depth-first search is the chance you'll get into a
loop going around and around a disconnected piece. The problem can be
avoided by making a rule to never cross your own path.

Or is there something more that I'm missing?

--Keith Lewis klewis {at} mitre.org
The above may not (yet) represent the opinions of my employer.

Date Subject Author
11/29/04 Michael Michalchik
11/30/04 Kevin Saff
11/30/04 Keith A. Lewis
11/30/04 Kevin Saff
11/30/04 Michael Michalchik
12/1/04 Kevin Saff