sudoku-solver 0.6.1

Simple backtracking algorithm for solving sudoku.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118

use super::*;

#[test]
fn default_board_is_empty() {
    let board = Board::default();

    for y in 0..BOARD_SIZE {
        for x in 0..BOARD_SIZE {
            assert_eq!(board.get_cell(x, y), 0);
            assert_eq!(board.get_cell_as_mask(x, y), 0b000_000_000_1);
        }
    }
}

#[test]
fn get_cell_works() {
    let mut board = Board::default();
    board.set_cell(2, 2, 0);
    board.set_cell(2, 3, 8);
    board.set_cell(2, 4, 9);

    assert_eq!(board.get_cell(2, 2), 0);
    assert_eq!(board.get_cell(2, 3), 8);
    assert_eq!(board.get_cell(2, 4), 9);
}

#[test]
fn get_cell_as_mask_works() {
    let mut board = Board::default();
    board.set_cell(2, 2, 0);
    board.set_cell(2, 3, 8);
    board.set_cell(2, 4, 9);

    assert_eq!(board.get_cell_as_mask(2, 2), 0b000_000_000_1);
    assert_eq!(board.get_cell_as_mask(2, 3), 0b010_000_000_0);
    assert_eq!(board.get_cell_as_mask(2, 4), 0b100_000_000_0);
}

#[test]
fn set_cell_works() {
    let mut board = Board::default();

    for y in 0..BOARD_SIZE {
        for x in 0..BOARD_SIZE {
            board.set_cell(x, y, 9);
            assert_eq!(board.get_cell(x, y), 9);

            board.set_cell(x, y, 0);
            assert_eq!(board.get_cell(x, y), 0);
        }
    }
}

#[test]
fn set_cell_as_mask_works() {
    let mut board = Board::default();

    for y in 0..BOARD_SIZE {
        for x in 0..BOARD_SIZE {
            board.set_cell_as_mask(x, y, 0b100_000_000_0);
            assert_eq!(board.get_cell(x, y), 9);

            board.set_cell_as_mask(x, y, 0b000_000_000_1);
            assert_eq!(board.get_cell(x, y), 0);
        }
    }
}

#[test]
fn string_rep_of_board_is_correct() {
    let board = Board::from(&[
        [1, 2, 3, 4, 5, 6, 7, 8, 9], // row 1
        [2, 3, 4, 5, 6, 7, 8, 9, 1], // row 2
        [3, 4, 5, 6, 7, 8, 9, 1, 2], // row 3
        [4, 5, 6, 7, 8, 9, 1, 2, 3], // row 4
        [5, 6, 7, 8, 9, 1, 2, 3, 4], // row 5
        [6, 7, 8, 9, 1, 2, 3, 4, 5], // row 6
        [7, 8, 9, 1, 2, 3, 4, 5, 6], // row 7
        [8, 9, 1, 2, 3, 4, 5, 6, 7], // row 8
        [9, 1, 2, 3, 4, 5, 6, 7, 8], // row 9
    ]);

    let str_rep = "1 2 3 4 5 6 7 8 9\n\
                   2 3 4 5 6 7 8 9 1\n\
                   3 4 5 6 7 8 9 1 2\n\
                   4 5 6 7 8 9 1 2 3\n\
                   5 6 7 8 9 1 2 3 4\n\
                   6 7 8 9 1 2 3 4 5\n\
                   7 8 9 1 2 3 4 5 6\n\
                   8 9 1 2 3 4 5 6 7\n\
                   9 1 2 3 4 5 6 7 8";

    assert_eq!(board.to_string(), str_rep);

    let board = Board::from(&[
        [1, 0, 0, 4, 0, 0, 7, 0, 0], // row 1
        [0, 0, 0, 0, 0, 0, 0, 0, 0], // row 2
        [0, 0, 0, 0, 0, 0, 0, 0, 0], // row 3
        [4, 0, 0, 7, 0, 0, 1, 0, 0], // row 4
        [0, 0, 0, 0, 0, 0, 0, 0, 0], // row 5
        [0, 0, 0, 0, 0, 0, 0, 0, 0], // row 6
        [7, 0, 0, 1, 0, 0, 4, 0, 0], // row 7
        [0, 0, 0, 0, 0, 0, 0, 0, 0], // row 8
        [0, 0, 0, 0, 0, 0, 0, 0, 0], // row 9
    ]);

    let str_rep = "1 - - 4 - - 7 - -\n\
                   - - - - - - - - -\n\
                   - - - - - - - - -\n\
                   4 - - 7 - - 1 - -\n\
                   - - - - - - - - -\n\
                   - - - - - - - - -\n\
                   7 - - 1 - - 4 - -\n\
                   - - - - - - - - -\n\
                   - - - - - - - - -";

    assert_eq!(board.to_string(), str_rep);
}