-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsuduku.py
60 lines (46 loc) · 1.21 KB
/
suduku.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
#! /usr/bin/python3
matrix = [ [7,0,1,0,0,2,0,4,3],
[0,0,6,4,0,3,0,0,0],
[0,0,0,9,0,0,6,1,0],
[0,1,4,7,0,0,0,0,0],
[0,0,0,0,5,0,0,0,0],
[0,0,0,0,0,6,1,2,0],
[0,3,7,0,0,9,0,0,0],
[0,0,0,6,0,7,3,0,0],
[9,8,0,1,0,0,0,0,7]
]
def possible(y,x,n):
global matrix
for i in range(0,9):
if matrix[y][i] == n:
return False
for i in range(0,9):
if matrix[x][i] == n:
return False
x0 = (x//3) * 3
y0 = (y//3) * 3
for i in range(0,3):
for j in range(0,3):
if matrix[y0+i][x0+j] == n:
return False
return True
def solve():
global matrix
for y in range(9):
for x in range(9):
if matrix[y][x] == 0:
for i in range(1,10):
if possible(y,x,i):
matrix[y][x] = i
solve()
matrix[y][x] = 0
return
print_matrix()
input('More ?')
def print_matrix():
global matrix
for row in matrix:
print(row)
print_matrix()
print('#################################')
solve()