Summary
Describes a way in which the maze generation algorithm (
Structure<TCell>.GenerateMaze(Func<int, int, int>, MazeBias)) proceeds.
Enum values
| 0 | The algorithm picks cells at random without bias. |
| 1 |
The algorithm exhausts all links of each new cell before moving on to the next (breadth-first). This generally
leads to long, straight corridors. |
| 2 |
The algorithm explores a link for every new cell before returning to the previous (depth-first). This
generally leads to more winding paths. |