Procedural 2D Dungeon Generation Using Binary Space Partition Algorithm And L-Systems

In game development, procedural method is a common method to reduce the high cost of content generation by artist. The idea of procedural content generation is to automate the generation content by developing a set of algoritmhs and rules based on the property of the content. Dungeon map generation plays a crucial role in creating immersive and challenging experiences in top-down roleplaying games (RPGs). This paper presents an approach to enhance dungeon map generation by combining the Binary Space Partition (BSP) algorithm and L-System that able to generate game-ready dungeon map. The proposed method uses BSP algorithm to perform an efficient space partition an L-System to generate diverse and visually appealing corridor between rooms. To validate the proposed system, we build a simple RPG game that employs our generator to generate a random dungeon network on each game session. The results shows that our method able to generate playable dungeon with a good level of playability.