Flexible Maze Generator

Originally based on Growing Tree algorithm, but with added features.

In essence this variant uses a mix of backtracking and random selection to fill a proportion of the grid (1.0 = all).

Complexity is the probability of using backtracking (vs. random pick) each iteration — high complexity tends to produce less branchy mazes. (The reason I called it complexity is that a complex maze is more likely to have blind alleys that aren't apparent from an intersection.)

Completeness is the number of cells the generator will "carve out".

Max isolation limits how isolated a cell can end up, where isolation is defined as the distance to the nearest junction. Algorithm only "de-isolates" 50% of eligible cells per pass, and will exit if no cells were carved during a pass. (Prevents deadlocks where setting is < 2.)

Width: Height: Complexity: Completeness:
Max isolation:

Ideas to make generated maps more "interesting" or less "random"

index html 11/04/2014 20:13:33

//projectweasel.com/Procedural-Assets/Maze-Generator/

Powered by FolderMark