Binary Tree Generator - Generate a maze using a binary tree strategy.
Binary Tree Maze Generator is one of the very rareful algorithms with the ability to generate a perfect maze without keeping any state at all: it is a true memoryless Maze generation algorithm with no limit to the size of Maze you can create. It can build the entire maze by looking at each cell independantly. This is basically the simplest and fastest algorithm possible.
Mazes generated are real Binary Tree Data Structure, while having a very biased texture.
|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 47 of file binary_tree_generator.hxx.