Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


Math Forum » Discussions » sci.math.* » sci.math

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Michael Michalchik

Posts: 89
Registered: 12/13/04
finite maze solving algorithm
Posted: Nov 29, 2004 10:05 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


I was wondering if anyone knows if all possible topologies of finite
2d mazes can be solved by a finite algorithm. For example, we know
that all fully connected mazes can be solved by picking a wall and
exhaustively following it. Can a general solution work for all mazes
including the ones that are piecewise disconnected? If this is
possible, is the general solution a solved problem?




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.