 |
| BSP Tree Dungeon Generation |
 |
| Cellular Automata |
Aside from just purely housekeeping and aesthetic things on this blog I've also just started working on doing my pseudo code for the dungeon generator. So far this is what I've figured out, using BSP Tree I can subdivide a large dungeon into smaller subsections. I would stop dividing these earlier than BSP Tree typically does so that I could have the program decide whether it will continue to divide then or generate a cave.
If the program decides to create a cave then within this subsection a cave will be made and connected to the dungeon later. Generating a cave will have a 30-40% chance of being initialized depending on what works best and feels the best generation wise. I have yet to determine what percentages work best, but once I do I'll be sure to include that on the Algorithm page. This is the section where the tile sets would be assigned to each of the sections. If the cave generation option isn’t chosen then the BSP Tree subdivision will continue within that square and after that section of code has finished running then rooms would be generated within the finished sub sections. After that has finished then the rooms will be connected via corridors.
The best part of this is that I most likely won’t have to change the room adjoining code because this section is just supposed to connect rooms. All that I will need to do is connect the rooms into the cave systems just by using the corridor placement. After that is done then the tile sets will be applied to each section. I've also placed pictures on the right of each of what each of the algorithms makes when it's finished running. That's about all that I got done this week, but I feel as though I've accomplished quite a bit.
