Struct Solver 

pub struct Solver {
    pub constraints: SudokuConstraints,
    pub techniques: Vec<Rc<dyn Technique>>,
    pub grid: Grid,
    pub solution: Option<Grid>,
    /* private fields */
}

Fields

constraints: SudokuConstraints

techniques: Vec<Rc<dyn Technique>>

grid: Grid

solution: Option<Grid>

Implementations

impl Solver

pub fn check_solved(&self) -> (bool, Option<InvalidStateReason>)

pub fn check_partially_solved(&self) -> (bool, Option<InvalidStateReason>)

impl Solver

pub fn detect_invalid_sum_candidates( &self, cells: &Vec<CellPosition>, sum: u32, ) -> Vec<(CellPosition, Vec<u32>)>

impl Solver

pub fn eliminate_combinations( &self, combinations: &Vec<Vec<u32>>, cells: &Vec<CellPosition>, ) -> CellEliminationsResult

impl Solver

pub fn logical_solve(&mut self) -> SudokulogicalSolveResult

pub fn find_candidate_validity_update_steps(&self) -> Vec<SolutionStep>

pub fn find_grid_steps(&self) -> Vec<SolutionStep>

pub fn apply_rule( &mut self, step: &SolutionStep, ) -> (bool, Option<InvalidStateReason>)

pub fn apply_rules(&mut self, steps: &Vec<SolutionStep>)

pub fn cell_candidates_diff( &self, cells: &Vec<CellPosition>, valid_candidates: Vec<HashSet<u32>>, ) -> Vec<(CellPosition, Vec<u32>)>

impl Solver

pub fn brute_solve(&mut self, use_logical: bool) -> SudokuBruteSolveResult

pub fn recursive_check( &mut self, solution_count: &mut u32, use_logical: bool, depth: u32, )

impl Solver

pub fn new( constraints: SudokuConstraints, input_grid: Option<SudokuGrid>, ) -> Solver

pub fn with_hint_mode(self, flag: bool) -> Self

pub fn with_step_count_limit(self, step_count_limit: usize) -> Self

pub fn default_techniques() -> Vec<Rc<dyn Technique>>

pub fn with_techniques(self, techniques: Vec<Rc<dyn Technique>>) -> Self

pub fn without_techniques(self, techniques: Vec<Rc<dyn Technique>>) -> Self

Trait Implementations

impl Clone for Solver

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.