✨ Add maze order (1 or 0) corresponding to the maze density

[bal7hazar]

Introduced changes

Add a new argument for maze and corridor generations, the density order.
The order of the maze, it must be 0 or 1, the higher the order the less dense the maze will be.

Note: I didnt managed higher orders since the definition is ambiguous and the scaling could be a problem.

Here an example:

Order 0 (current implementation)

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 1 1 1 0 1 1 1 1 1 1 1 1 0 1 0
0 1 1 0 1 0 1 1 0 0 1 0 0 0 1 1 1 0
0 0 1 1 1 1 0 1 1 0 1 1 1 1 0 0 1 0
0 1 1 0 0 1 0 0 1 1 0 1 0 1 0 1 0 0
0 1 0 0 0 1 1 1 1 0 1 0 0 1 1 1 1 0
0 1 1 0 1 0 0 0 0 0 1 1 1 0 1 0 1 0
0 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 1 0
0 1 0 1 0 1 1 0 0 1 1 1 0 1 1 1 0 0
0 1 0 1 1 1 0 1 1 1 0 1 1 0 1 0 1 0
0 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0
0 0 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 0
0 1 1 0 1 0 0 1 1 1 0 1 1 1 0 1 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Order 1 (new implementation, with the same seed)

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0
0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 1 1 0
0 1 1 0 0 0 0 1 0 0 1 1 1 1 0 0 1 0
0 0 1 1 1 1 0 1 1 0 0 0 0 1 0 0 0 0
0 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 1 0
0 1 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
0 1 1 0 0 0 0 0 0 0 0 0 1 0 0 1 1 0
0 0 1 1 0 0 1 1 1 1 0 1 1 0 1 1 0 0
0 0 0 1 0 1 1 0 0 1 1 1 0 0 1 0 0 0
0 1 0 1 1 1 0 0 0 1 0 1 0 1 1 1 1 0
0 1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0
0 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Basically, order 1 disallow these patterns (having 2 floors connected diagonally):

1 1 0
0 0 1
0 1 1

[glihm]

The order is a bit abstract and maybe having an enum for supported values instead of a u8 is we can't support more than 2 values could be good.

Or if you feel like it will be possible to extend the order to any u8 then makes sense to keep it like so. 👍

[glihm]

the -2 here looks a bit magic, perhaps having this in a constant that have a more descriptive name could help the understanding.

[glihm]

Same for some offset used in this function.

[bal7hazar]

Actually 3 was weird but size - 2 is actually the range of the indexes (from 0 to size - 1) substracting 1 to ensure we didnt reached the edge yet.

It could be rewrite such as:

let last_index = height - 1;
let one_before_last_index = last_index - 1;
match direction {
    Direction::North => (y < one_before_last_index)
...
}

But maybe I could just add some comments to explain it, wdyt?

[glihm]

Comment would be fine yeah, was trying to grasp the idea of those indexes. Thanks!