Struct quickbacktrack::BackTrackSolver

pub struct BackTrackSolver<T> where
    T: Puzzle,  {
    pub states: Vec<T>,
    pub choice: Vec<(T::Pos, Vec<T::Val>)>,
    pub settings: SolveSettings,
}

Solvees puzzles using back tracking.

Fields

states: Vec<T>

Stores the states.

choice: Vec<(T::Pos, Vec<T::Val>)>

Stores the choices for the states.

settings: SolveSettings

Search for simple solutions.

Methods

impl<T> BackTrackSolver<T> where
    T: Puzzle, 

fn new(puzzle: T, settings: SolveSettings) -> BackTrackSolver<T>

Creates a new solver.

fn solve<F, G>(self, f: F, g: G) -> Option<Solution<T>> where
    F: FnMut(&T) -> Option<T::Pos>,
    G: FnMut(&T, T::Pos) -> Vec<T::Val>, 

Solves puzzle, using a closure to look for best position to set a value next, and a closure for picking options in preferred order.

The second closure returns possible values at a given position. The last move in the list has highest priority, because the solver pops the values in turn.