Struct sudoku_variants::solver::strategy::impls::NakedSingleStrategy

pub struct NakedSingleStrategy;

A Strategy which detects naked singles, that is, cells which only have one possible value, and enters them into the Sudoku.

As a small example, take a look at the following grid:

╔═══╤═══╦═══╤═══╗
║ X │   ║   │ 2 ║
╟───┼───╫───┼───╢
║   │ 1 ║   │   ║
╠═══╪═══╬═══╪═══╣
║   │   ║   │   ║
╟───┼───╫───┼───╢
║ 3 │   ║   │   ║
╚═══╧═══╩═══╧═══╝

The cell marked with X cannot be a 1 because of the 1 in its block, nor a 2 because of the 2 in its row, and also cannot be a 3 because of the 3 in its column. Consequently, it can only be a 4. This would be detected by this strategy.

Trait Implementations

impl Clone for NakedSingleStrategy

fn clone(&self) -> NakedSingleStrategy

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Strategy for NakedSingleStrategy

fn apply(&self, sudoku_info: &mut SudokuInfo<impl Constraint + Clone>) -> bool

Applies this strategy to the given Sudoku. The strategy may rely on and modify the information in the given sudoku_info. This instance is given to other strategies that participate in the solution and/or future iterations of the same strategy. It can thus be used to communicate insights.