Recursive Division Generator - Generate a maze using a recursive division strategy.
Recursive Division Maze Generator is the fastest algorithm without directional biases. While Recursive division really stands out with respect to parallelism, this algorithm is particularly fascinating because of its fractal nature: you could theoretically continue the process indefinitely at finer and finer levels of detail (smaller and smaller scales).
This algorithm is somewhat similar to recursive backtracking, since they're both stack based, except this focuses on walls instead of passages. As a Wall Builders generator, the process begins with a large empty space (all cells are connected), and adds walls (disconnect cells) until a maze results.
|width||desired width for the maze. |
|height||desired height for the maze. |
|seed||number used to initiate the random generator.|
- Operator() returns Maze Grid pointer to be owned, nullptr if construction failed.
Definition at line 50 of file recursive_division_generator.hxx.