-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsudoku_validator.py
More file actions
55 lines (48 loc) · 1.51 KB
/
sudoku_validator.py
File metadata and controls
55 lines (48 loc) · 1.51 KB
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
def validSolution(board):
arr = []
valid = []
for i in range(27):
arr.append([])
#rows
for i in range(9):
arr[i] = board[i]
#columns
for i in range(9):
for j in range(9):
arr[i+9].append(board[j][i])
#top_squares
for j in range(3):
for k in range(3):
arr[18].append(board[j][k])
for j in range(3, 6):
for k in range(3):
arr[19].append(board[j][k])
for j in range(6, 9):
for k in range(3):
arr[20].append(board[j][k])
#mid_squares
for j in range(3):
for k in range(3, 6):
arr[21].append(board[j][k])
for j in range(3, 6):
for k in range(3, 6):
arr[22].append(board[j][k])
for j in range(6, 9):
for k in range(3, 6):
arr[23].append(board[j][k])
#bot_squares
for j in range(3):
for k in range(6, 9):
arr[24].append(board[j][k])
for j in range(3, 6):
for k in range(6, 9):
arr[25].append(board[j][k])
for j in range(6, 9):
for k in range(6, 9):
arr[26].append(board[j][k])
for i in range(27):
if arr[i].count(1) == 1 and arr[i].count(2) == 1 and arr[i].count(3) == 1 and arr[i].count(4) == 1 and arr[i].count(5) == 1 and arr[i].count(6) == 1 and arr[i].count(7) == 1 and arr[i].count(8) == 1 and arr[i].count(9) == 1:
valid.append(True)
if len(valid) == 27:
return True
return False