-
Notifications
You must be signed in to change notification settings - Fork 0
/
solver_text.py
89 lines (70 loc) · 1.81 KB
/
solver_text.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
# solver.py
def solve(bo):
"""
Solves a sudoku board using backtracking
:param bo: 2d list of ints
:return: solution
"""
find = find_empty(bo)
if find:
row, col = find
else:
return True
for i in range(1,10):
if valid(bo, (row, col), i):
bo[row][col] = i
if solve(bo):
return True
bo[row][col] = 0
return False
def valid(bo, pos, num):
"""
Returns if the attempted move is valid
:param bo: 2d list of ints
:param pos: (row, col)
:param num: int
:return: bool
"""
# Check row
for i in range(0, len(bo)):
if bo[pos[0]][i] == num and pos[1] != i:
return False
# Check Col
for i in range(0, len(bo)):
if bo[i][pos[1]] == num and pos[1] != i:
return False
# Check box
box_x = pos[1]//3
box_y = pos[0]//3
for i in range(box_y*3, box_y*3 + 3):
for j in range(box_x*3, box_x*3 + 3):
if bo[i][j] == num and (i,j) != pos:
return False
return True
def find_empty(bo):
"""
finds an empty space in the board
:param bo: partially complete board
:return: (int, int) row col
"""
for i in range(len(bo)):
for j in range(len(bo[0])):
if bo[i][j] == 0:
return (i, j)
return None
def print_board(bo):
"""
prints the board
:param bo: 2d List of ints
:return: None
"""
for i in range(len(bo)):
if i % 3 == 0 and i != 0:
print("- - - - - - - - - - - - - -")
for j in range(len(bo[0])):
if j % 3 == 0:
print(" | ",end="")
if j == 8:
print(bo[i][j], end="\n")
else:
print(str(bo[i][j]) + " ", end="")