Level generation algorithm

Algorithm moved to Dungeon Generator

This project is for presentation and debugging dungeon generation algorithm. It works in three steps

Workspace splitting to random rectangles with the help of binary tree
In every rectangle generating a random room
Coridors generating with the help of the binary tree, generated at the first step

For now you can customize generation with this constants (may be someday it will become crate with user-friendly configuration, but not today):

DN_MAX_DEEP - levels of binary tree
DN_ALLOW_FULL_FROM - level of tree from which node can deny split
DN_SPLIT_CHANCE_DEC - split chance decreasment per tree level starting from DN_ALLOW_FULL_FROM
DN_SPLIT_COEFF - max splitting coefficient
DN_DEFAULT_CHANCE - default splitting chance
DN_MIN_SP_SIZE - minimum splittable size of subdungeon
DN_CORIDOR_WIDTH - constant width of corridors

This project is licensed under the MIT license. Please read the LICENSE file in this repository for more information.

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
src		src
.gitignore		.gitignore
Cargo.lock		Cargo.lock
Cargo.toml		Cargo.toml
LICENSE		LICENSE
README.md		README.md
debug_draw_sc.png		debug_draw_sc.png