An insight given to the
Algorithm on every
On the first time about the starting point and every consecutive call about the tail of the previous guess.
Data structure representing a maze on a grid.
stores each possible paths as a
HashMap mapping each positions to the accessible adjascent ones.
A discrete position on a 2D-grid.
Most common maze generation technique, recursively creating paths to unvisited cells, each time choosing next direction at random.
Trait encapsulating the behavior of an algorithm solving mazes.
Implementing this trait is done by providing a
progress method which gets called iteratively on each steps of a [
Trait encapsulating the behavior of a type capable to create mazes.