Xref: utzoo alt.sources.d:1213 rec.games.misc:12937 rec.games.programmer:2730 Path: utzoo!attcan!utgpu!cs.utexas.edu!samsung!emory!hubcap!ncrcae!mcneely From: mcneely@ncrcae.Columbia.NCR.COM (Alan McNeely) Newsgroups: alt.sources.d,rec.games.misc,rec.games.programmer Subject: Re: Maze generation Keywords: how-to maze generate program wanted Message-ID: <6892@ncrcae.Columbia.NCR.COM> Date: 20 Dec 90 20:18:12 GMT References: <1990Dec15.122555.20420@cs.ubc.ca> <6WH^XJ_@rpi.edu> <21945@ttidca.TTI.COM> Reply-To: mcneely@ncrcae.Columbia.NCR.COM (Alan McNeely) Organization: NCR Corp., Engineering & Manufacturing - Columbia, SC Lines: 28 >In article <21945@ttidca.TTI.COM> alter@ttidca.TTI.COM (Steve Alter) writes: >>The right-hand-on-the-wall algorithm, in its simple form, won't be able >>connected) but a simple modification to the algorithm can fix that. >>Just remember every room you've visited, and as you're walking around, >>if you see that you're about to step into an already visited room, then >>just pretend that there's a wall in front of you and continue to apply >>the right-hand rule. After that, you can forget about that piece of >>phantom wall, because the rooms on both sides of it have been visited. >> Actually I think you have to remember the wall. Example: ----- ! ! ! ! ! ______! ! ! FINISH ! ------ -- ! ! ! ! START From Start, algorithm goes right, creates imaginary wall coming back down toward the 4-way, and goes back around the inside of the loop. If we don't remember the imaginary wall we'll be trapped on the loop indefinitely. Right? Alan McNeely mcneely@bigb.columbia.ncr.com