I have put the complete series into a Word document so you could easily print it. I have done some code formatting and did not copy the conclusion and introduction for each chapter. Hope you like it.

http://www.dragon-net.de/generating_random_dungeons.docx

Greets
Christoph

I haven’t really worried about extremely large levels. But you’re right, you could use sectors to join maps or rooms.

In later versions my rooms are maps. A “room” can therefore be hand crafted to represent any structure.

-D

Another possibility with your “rooms are a type of map” idea is to use the Composite DP. This would be particularly useful if you were to extend your map-room relationship by one more level, eg. map-sector-room. Then both sector and room would implement Composite. The advantage of a sectors-based system would obviously be improved spatial hashing for building extremely large levels (I am planning on doing this), with the entire structure being an n-tree.

I am guessing you may have realised this but opted out, as you were focusing on other matters in this article.

-Nick

http://www.codeplex.com/RDG

I haven’t noticed the expand to tiles bug. This could be detected by using some kind of solver for the map and checking if all floor cells were traversed.

I will update the source code to reflect the X-Y axes change.

It occasionally creates hallways that aren’t connected to anything. I’ve seen this on two maps out of about 10 now. Not that big a deal if you don’t put stairs in hallways, but if you do there’s a chance of a game-ending bug there.

The other thing is that in your test program you actually display the map with Y and X axes reversed. Didn’t notice it until I made a map that wasn’t symmetrical.

Just a couple of notes… Otherwise, top notch work.