Struct StrategicBacktrackingSolver 

pub struct StrategicBacktrackingSolver<S: Strategy> { /* private fields */ }

A perfect Solver which uses a Strategy to accelerate the solving process. Under the assumption that the strategy is correct, this should yield the same result as a BacktrackingSolver. Note that using a complicated strategy can also reduce performance if its utility is too low.

Implementations

impl<S: Strategy> StrategicBacktrackingSolver<S>

pub fn new(strategy: S) -> StrategicBacktrackingSolver<S>

Creates a new strategic backtracing solver that uses the given strategy.

Trait Implementations

impl<S: Strategy> Solver for StrategicBacktrackingSolver<S>

fn solve(&self, sudoku: &Sudoku<impl Constraint + Clone>) -> Solution

Solves, or attempts to solve, the provided Sudoku. If the solver cannot prove that a Sudoku is impossible or uniquely solveable (either because it isn’t or the solver is not powerful enough), they shall return Solution::Ambiguous.