|typedef Grid< CellInfoBase >||Maze|
|std::unique_ptr< Maze >||operator() (const uint32_t width, const uint32_t height, const uint32_t seed=0)|
Sidewinder Generator - Generate a maze using a sidewinder strategy.
Sidewinder Maze Generator is very similar to the Binary Tree algorithm, and only slightly more complicated. Furthermore, the Sidewinder algorithm only needs to consider the current row, and therefore can be used to generate infinitely large mazes (like the Binary Tree).
While binary tree mazes have two of its four sides being one long passage, a Sidewinder mazes have just one long passage.
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.
Member Typedef Documentation
Member Function Documentation
The documentation for this class was generated from the following file: