-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathSudukoSolver.py
89 lines (72 loc) · 2.06 KB
/
SudukoSolver.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
board = [[6, 0, 9, 0, 0, 0, 3, 0, 0],
[5, 0, 1, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 8, 9, 0, 0, 0, 0],
[0, 0, 0, 3, 5, 0, 0, 6, 0],
[9, 5, 0, 6, 0, 8, 0, 3, 7],
[0, 3, 0, 0, 4, 7, 0, 0, 0],
[0, 0, 0, 0, 2, 1, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 8, 0, 2],
[0, 0, 3, 0, 0, 0, 9, 0, 4]]
def print_board(board):
for i in range(len(board)):
if i % 3 == 0 and i != 0:
print("- - - - - - - - - - -")
for j in range(len(board[0])):
if j % 3 == 0 and j != 0:
print("|", end=" ")
if board[i][j] == 0:
print("#", end=" ")
else:
print(board[i][j], end=" ")
print()
def find_empty(board):
for i in range(len(board)):
for j in range(len(board[0])):
if board[i][j] == 0:
return (i, j) # row, col
return None
def check_postion(board, num, pos):
"""
Returns True if position number is valid at the position
pos should be row, col
"""
# check row
for i in range(len(board[0])):
if board[pos[0]][i] == num and pos[1] != i:
return False
# check column
for j in range(len(board)):
if board[j][pos[1]] == num and pos[0] != j:
return False
# check 3x3 box
# box_x in loop
box_y = (pos[0] // 3) * 3
# max is in loop with box_x
max_y = box_y + 3
while box_y < max_y:
box_x = (pos[1] // 3) * 3
max_x = box_x + 3
while box_x < max_x:
if board[box_y][box_x] == num:
return False
box_x += 1
box_y += 1
return True
def solve(board):
find = find_empty(board)
if not find:
return True
else:
row, col = find
for num in range(1, 10):
if check_postion(board, num, (row, col)):
board[row][col] = num
if solve(board):
return True
board[row][col] = 0
return False
print_board(board)
print()
solve(board)
print()
print_board(board)