Struct BacktrackingSolver 

pub struct BacktrackingSolver;

A perfect Solver which solves Sudoku by recursively testing all valid numbers for each cell. This means two things:

• Its worst-case runtime is exponential, i.e. it may be very slow if the Sudoku has many missing digits.
• It can provide the correct Solution for any Sudoku with any constraint.

Trait Implementations

impl Solver for BacktrackingSolver

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.