Struct sudoku_variants::generator::Reducer

pub struct Reducer<S: Solver, R: Rng> { /* fields omitted */ }

A reducer can be applied to the output of a Generator to remove numbers from the grid as long as it is still uniquely solveable using the provided Solver. This may be intentionally suboptimal to control the difficulty. A random number generator decides which digits are removed.

Reducer::new_default will yield a reducer with the highest difficulty (a perfect backtracking solver) and a ThreadRng.

Implementations

impl Reducer<BacktrackingSolver, ThreadRng>

pub fn new_default() -> Reducer<BacktrackingSolver, ThreadRng>

Generates a new reducer with a BacktrackingSolver to check unique solveability and a ThreadRng to decide which digits are removed.

impl<S: Solver, R: Rng> Reducer<S, R>

pub fn new(solver: S, rng: R) -> Reducer<S, R>

Creates a new reducer with the given solver and random number gnerator.

Arguments

• solver: A Solver to be used to check whether a reduced Sudoku is still uniquely solveable. This controls the difficulty by specifying a strategy that must be able to solve the Sudoku.
• rng: A random number generator that decides which digits are removed.

pub fn reduce<C: Constraint + Clone>(&mut self, sudoku: &mut Sudoku<C>)

Reduces the given Sudoku as much as possible. That is, removes random digits until all remaining ones are necessary for the solver used by this reducer to still be able to solve the Sudoku. All changes are done to the given mutable Sudoku.