
finite maze solving algorithm
Posted:
Nov 29, 2004 10:05 PM


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?

