-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbacktrack.py
75 lines (69 loc) · 2.14 KB
/
backtrack.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
from random import randrange
def nextOpenSpot(grid):
for i in range(9):
for j in range(9):
if grid[i][j] == 0:
return i, j
return -1, -1
def checkWin(grid):
for i in range(len(grid)):
for j in range(len(grid)):
if grid[i][j] == 0:
return False
else:
temp = grid[i][j]
grid[i][j] = 0
valid = validMove(grid, i, j, temp)
grid[i][j] = temp
if not valid:
return False
return True
def validGrid(grid):
for i in range(len(grid)):
for j in range(len(grid)):
if grid[i][j] != 0:
temp = grid[i][j]
grid[i][j] = 0
valid = validMove(grid, i, j, temp)
grid[i][j] = temp
if not valid:
return False
return True
def validMove(grid, r, c, num):
rowValid = all(num != grid[r][i] for i in range(9))
if rowValid:
columnValid = all(num != grid[i][c] for i in range(9))
if columnValid:
# coordinates of top-left corner of sector
rSector, cSector = 3* (r//3), 3 * (c//3)
for i in range(rSector, rSector+3):
for j in range(cSector, cSector+3):
if num == grid[i][j]:
return False
return True
return False
def solve(grid):
r, c = nextOpenSpot(grid)
if r == -1:
return True
for num in range(1, 10):
if validMove(grid, r, c, num):
grid[r][c] = num
if solve(grid):
return True
grid[r][c] = 0
return False
def randomSolve(grid):
r, c = nextOpenSpot(grid)
if r == -1:
return True
values = [i for i in range(1, 10)]
length = len(values)
while length > 0:
num = values[randrange(length)]
if validMove(grid, r, c, num):
grid[r][c] = num
if solve(grid):
return True
grid[r][c] = 0
return False