pub trait Algorithm {
    fn progress(
        &mut self,
        insight: &Insight<'_>,
        ctx: &mut Context<'_>
    ) -> Guess; }
Expand description

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 [Maze] resolution.

Required Methods

will be called on each step of the traversal of the [Maze]. insight is a view on the position discovered on the previous movement. ctx is a view on the [Maze], useful for accessing properties of the maze.

Implementors