/
test_sudoku_solver.py
148 lines (101 loc) · 4.09 KB
/
test_sudoku_solver.py
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
import unittest
from sudoku_solver import SudokuSolver, create_zero_grid, create_solved_grid, create_real_world_grid,create_hard_sudoku
class TestSudokuSolver(unittest.TestCase):
def test_all_positions_and_numbers_are_possible_on_zero_grid(self):
grid = create_zero_grid()
solver = SudokuSolver(grid)
for number in range(1, 10):
for col in range(9):
for row in range(9):
self.assertTrue(solver._is_possible(col,row,number))
def test_cannot_insert_number_if_it_is_already_on_same_row(self):
grid = create_zero_grid()
row = 3
number = 8
grid[2][row] = number
solver = SudokuSolver(grid)
self.assertFalse(solver._is_possible(4,row,number))
# ok for neighbor row
self.assertTrue(solver._is_possible(4,row + 1,number))
def test_cannot_insert_number_if_it_is_already_on_same_column(self):
grid = create_zero_grid()
col = 3
number = 8
grid[col][2] = number
solver = SudokuSolver(grid)
self.assertFalse(solver._is_possible(col,4,number))
# ok for neighbor col
self.assertTrue(solver._is_possible(col + 1, 4 ,number))
def test_cannot_insert_number_if_it_is_already_on_same_block(self):
grid = create_zero_grid()
number = 8
grid[1][1] = number
grid[4][4] = number
grid[7][7] = number
solver = SudokuSolver(grid)
self.assertFalse(solver._is_possible(2,2,number))
self.assertFalse(solver._is_possible(5,5,number))
self.assertFalse(solver._is_possible(8,8,number))
def test_solve_missing_one_number(self):
grid = create_solved_grid()
grid[0][0] = 0
solver = SudokuSolver(grid)
self.assertTrue( solver.brut_force() )
self.assertEqual(solver._grid , create_solved_grid() )
def test_solve_missing_two_number(self):
grid = create_solved_grid()
grid[0][0] = 0
grid[7][8] = 0
solver = SudokuSolver(grid)
self.assertTrue( solver.brut_force() )
self.assertEqual(solver._grid , create_solved_grid() )
@unittest.skip("brut force is too long")
def test_solve_real_word_sudoku(self):
grid = create_real_world_grid()
solver = SudokuSolver(grid)
import time
start = time.monotonic()
self.assertTrue( solver.brut_force() )
end = time.monotonic()
print ("elapsed = {} s".format(end - start))
self.assertTrue( solver.check())
solver._debug()
def test_find_safest_position_to_solve(self):
grid = create_solved_grid()
solution = grid[8][8]
grid[8][8] = 0
solver = SudokuSolver(grid)
self.assertEqual( solver.find_safest_position_to_solve(), ( (8, 8),[solution]) )
def test_safest_first_solver(self):
print("test_safest_first_solver")
grid = create_real_world_grid()
solver = SudokuSolver(grid)
self.assertTrue( solver.safest_first_solver() )
self.assertTrue( solver.check())
solver._debug()
def test_safest_first_solver_with_hard_one(self):
print("test_safest_first_solver_with_hard_one")
grid = create_hard_sudoku()
solver = SudokuSolver(grid)
self.assertTrue( solver.safest_first_solver() )
self.assertTrue( solver.check() )
solver._debug()
def test_safest_first_solver_with_other_hard_one(self):
print("test_safest_first_solver_with__other_hard_one")
grid = [
[1,0,0, 0,0,0, 0,0,0],
[3,8,0, 0,0,1, 0,0,0],
[0,7,0, 0,0,3, 5,0,0],
[8,0,0, 0,3,5, 7,2,0],
[0,0,3, 0,7,0, 4,0,0],
[0,9,2, 8,4,0, 0,0,3],
[0,0,8, 2,0,0, 0,4,0],
[0,0,0, 4,0,0, 0,6,7],
[0,0,0, 0,0,0, 0,0,1]
]
solver = SudokuSolver(grid)
self.assertTrue( solver.safest_first_solver() )
self.assertTrue( solver.check())
solver._debug()
if __name__ == '__main__':
unittest.main()