-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsudoku.py
50 lines (39 loc) · 1.09 KB
/
sudoku.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
import numpy as np
grid = [[0, 0, 9, 0, 3, 0, 2, 0, 0],
[0, 7, 0, 0, 1, 0, 0, 4, 0],
[0, 5, 0, 4, 0, 7, 0, 6, 0],
[1, 0, 0, 5, 7, 3, 0, 0, 6],
[0, 3, 0, 0, 0, 0, 0, 9, 0],
[7, 0, 0, 2, 9, 6, 0, 0, 5],
[0, 4, 0, 9, 0, 2, 0, 7, 0],
[0, 2, 0, 0, 6, 0, 0, 5, 0],
[0, 0, 6, 0, 8, 4, 9, 0, 0]
]
def possible(y, x, n):
global grid
for i in range(0, 9):
if grid[y][i] == n:
return False
for i in range(0,9):
if grid[i][x] == n:
return False
x0 = (x//3)*3
y0 = (y//3)*3
for i in range(0,3):
for j in range(0,3):
if grid[y0+i][x0+j] == n:
return False
return True
print(np.matrix(grid))
def solve():
global grid
for y in range(9):
for x in range(9):
if grid[y][x] == 0:
for n in range(0, 10):
if possible(y, x, n):
grid[y][x] = n
solve()
grid[y][x] = 0
return
print(np.matrix(grid))