🚀 go-pugleaf

In article <1992Aug6.225108.572@ccu1.aukuni.ac.nz>, rossw@ccu1.aukuni.ac.nz (Ross Williamson) writes...
>I also want every possible room to be connected ......
>And I don't want to enter the maze from one point and exit at another
>I just need it so that it generates a set of connections between all 
>rooms :(    it's a bit of a dog but it's something I need to solve.

Well, a decent algorithm for which I can take no credit follows.
	- Mark all of the squares in the maze as unused.
	- Start at any square in the maze.
	- Record all possible unused maze squares around the square (referred
		hereafter as possible next squares.)
	- While there are still unused maze squares:
		- Randomly choose one of the possible next squares.
		- Mark it used.
		- Connect it with the currently used squares next to it.
		- Add adjacent unconnected squares to the possible next square
			 list.

Different maze types can be generated by fiddling with the
connection target and possibly with the next random target.

While I've not gotten around to playing with this algorithm yet, I've
seen it used, and it works fine.
	
Credit for this algorithm goes to Scott Berry (FXSDB@acad3.alaska.edu) who
pointed it out to me when I thought I needed something similar.
Whether he had the genius to steal it from someone else, or just 
created it himself, I cannot say.
=============================================================================
-Mike Kienenberger                       SXMLK@ALASKA           (BITNet)
 University of Alaska Computer Network   SXMLK@acad3.alaska.edu (Internet)
 University of Alaska-Fairbanks