Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!howland.reston.ans.net!ix.netcom.com!netcom.com!scottec
From: scottec@netcom.com (Scott Cunningham)
Subject: Maze solution
Message-ID: <scottecD5srLn.JC1@netcom.com>
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
References: <3kc8d8$14f6@hermes.acs.ryerson.ca> <3ke7s2$5pe@news.halcyon.com>
Date: Tue, 21 Mar 1995 15:41:47 GMT
Lines: 19
Sender: scottec@netcom4.netcom.com

	One solution (although not from a first person perspective) is to 
solve the maze using cellular automina (sp?)

	For each point in maze
		If point has three walls fill in forth wall
	Repeat until no walls made this pass
		If point has less than two walls
			test path for loop or exit
			if loop make wall restart algorithim

	This should result in one of the solution paths being the only 
one left.  If you stop after the first part of the algorithim then all 
solution paths are left (all dead ends have been filled)

	This will also work for nth dimentional mazes not just 2d.

	Scott


