-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsudokuSolver.py
65 lines (42 loc) · 1.35 KB
/
sudokuSolver.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
#Find cells
def pronadji_prazna_polja(tabla):
for i in range(9):
for j in range(9):
if(tabla[i][j] == 0):
return i,j
return -1,-1
#Check solution
def provera_resenja_sudoku(tabla):
#Find empty cell
vrsta,kolona = pronadji_prazna_polja(tabla)
#Puzzle is solved
if(vrsta == -1):
return True
for broj in range(1,10):
if(validan_potez(tabla,vrsta,kolona,broj)):
#Place num
tabla[vrsta][kolona] = broj
#Recursion
if(provera_resenja_sudoku(tabla)):
return True
#If not possible remove that number
tabla[vrsta][kolona] = 0
#Backtrack
return False
#Valid move
def validan_potez(tabla,vrsta,kolona,broj):
#Check if num is in row
for i in range(0,9):
if(tabla[vrsta][i] == broj):
return False
#Check if num is in column
for i in range(0,9):
if(tabla[i][kolona] == broj):
return False
vrsta_kvadrata = (vrsta // 3) * 3
kolona_kvadrata = (kolona // 3) * 3
for i in range(vrsta_kvadrata,vrsta_kvadrata+3):
for j in range(kolona_kvadrata,kolona_kvadrata+3):
if(tabla[i][j] == broj):
return False
return True