Struct SudokuBoard

pub struct SudokuBoard {
    pub cells: [[Cell; 9]; 9],
}

Fields

cells: [[Cell; 9]; 9]

Implementations

impl SudokuBoard

pub fn new() -> Self

Create an empty board with all cells “locked”

pub fn fill(&mut self)

Fill board completely with solved state

pub fn unused_in_box( grid: [[Cell; 9]; 9], row_start: usize, col_start: usize, num: u8, ) -> bool

Returns false if given SRN x SRN block contains num.

pub fn check_if_safe(grid: [[Cell; 9]; 9], i: usize, j: usize, num: u8) -> bool

Check if safe to put in cell

pub fn unused_in_row(grid: [[Cell; 9]; 9], i: usize, num: u8) -> bool

pub fn unused_in_col(grid: [[Cell; 9]; 9], j: usize, num: u8) -> bool

pub fn fill_remaining(&mut self, i: usize, j: usize) -> bool

A recursive function to fill remaining matrix

pub fn solve(grid: [[Cell; 9]; 9], counter: u32) -> u32

Get the amount of unique solutions a board has

pub fn check_valid(grid: [[Cell; 9]; 9]) -> bool

Check if the board has no mistakes

pub fn check_solved(grid: [[Cell; 9]; 9]) -> bool

Check if the board is solved

pub fn check_filled(grid: [[Cell; 9]; 9]) -> bool

Check if the board is completely filled

pub fn remove_cells(&mut self, attempts: u32)

Remove cells from the filled solved board to make a puzzle

pub fn display(&self)

Display the board in stdout

pub fn display_grid(grid: &[[Cell; 9]; 9])

Display grid in stdout