Recursive Dungeon Generation
This Demonstration uses a simple recursive algorithm to generate dungeon floor plans. The algorithm works by placing a room, drawing two hallways from random points on the room's walls, and then repeating the process with these two new starting points. While rooms are not allowed to be placed on top of each other, hallways can cross into rooms and through other hallways. Therefore boring dungeons are unlikely, provided that the number of rooms is sufficiently high for the dungeon size. The proposed start of the dungeon is marked in green, and the proposed exit point is marked in red. Because of the way the algorithm works, the start will always be connected to the end, so the dungeons will always be possible.