Question

Sudoku is a popular number puzzle that appears in many newspapers on a daily basis. The objective of the game (adopted from Wikipedia) is: "... to fill a 9x9 grid with digits so that each column, each row, and each of the nine 3x3 sub-grids that compose the grid contains all of the digits from I to 9. The puzzle setter provides a partially completed grid, which typically has a unique solution. Correctly completed puzzles have an additional constraint on the contents of individual regions: the same single integer may not appear twice in the same 9x9 playing board row or column or in any of the nine 3x3 subregions of the 9x9 playing board" Below is an example puzzle and its solution:

Hi, I don't know how to deal with this python question. Modules are not recommended.

Answer 1

//Python program

def checkRow(puzzle):
for i in range(9):
rowOccurence = [0,0,0,0,0,0,0,0,0,0]
for j in range(9):
rowOccurence[puzzle[i][j]] += 1
tempRow = rowOccurence[1:10]
for q in range(9):
if tempRow[q] == 1 or tempRow[q] == 0:
continue
else:
return False
return True

def checkColumn(puzzle):
for num in range(9):
colOccurence = [0,0,0,0,0,0,0,0,0,0]
for i in range(9):
colOccurence[puzzle[i][num]] += 1
tempCol = colOccurence[1:10]
for q in range(9):
if tempCol[q] == 1 or tempCol[q] == 0:
continue
else:
return False
return True

def checkSudoku(puzzle):
if len(puzzle) == 9:
numsInRow = 0
for i in range(9):
if len(puzzle[i]) == 9:
numsInRow += 1
if numsInRow == 9:
if checkRow(puzzle):
if checkColumn(puzzle):
return True
else:
return False
else:
return False
else:
return False
else:
return False

print(checkSudoku([[5,3,4,6,7,8,9,1,2],\
[6,7,2,1,9,5,3,4,8],\
[1,9,8,3,4,2,5,6,7],\
[8,5,9,7,6,1,4,2,3],\
[4,2,6,8,5,3,7,9,1],\
[7,1,3,9,2,4,8,5,6],\
[9,6,1,5,3,7,2,8,4],\
[2,8,7,4,1,9,6,3,5],\
[3,4,5,2,8,6,1,7,9] ]))
  
print(checkSudoku([[5,3,4,6,7,8,9,1,2],\
[6,7,2,1,9,5,3,4,8],\
[1,9,8,3,4,2,4,6,7],\
[8,5,9,7,6,1,5,2,3],\
[4,2,6,8,5,3,7,9,1],\
[7,1,3,9,2,4,8,5,6],\
[9,6,1,5,3,7,2,8,4],\
[2,8,7,4,1,9,6,3,5],\
[3,4,5,2,8,6,1,7,9] ]))

//screenShots

main.py 1 def checkRow (puzzle): 3 5 for i in range(9): rowOccurence [e,e,0,0,0,0,e,0,0,0] for J in range(9 rowOccurence[puzzle[i]Ijl] 1 tempRow rowOccurence[1:10] for q in range (9): 6 if tempRow[q] 1 or tempRow[q] 0: 9 continue 10 else: return False 12 13 14 def checkColumn (puzzle): 15 return True for num in range (9): colOccurence [e,e,0,0,0,0,e,0,0,0] for i in range (9): 18 coloccurence[puzzle[i][num]] 1 tempCo1 co10ccurence[1:10] for q in range (9): 21 if tempCol[q] 1 or tempCol[q] 0: continue 23 else: return False 25 26 27 def checkSudoku (puzzle): return Irue if len(puzzle) 9: 29 30 for i in range (9):

main.DV 27 def checkSudoku (puzzle): 28 29 if len(puzzle) 9: um s InRow = 0 for i in range (9): if I (puzzle[i]) -9: 32 if checkRow (puzzle): if checkColumn (puzzle): 35 36 return True eise 38 39 40 return False else: return False eise 42 return Faise else: return False 45 46 48 print (checkSudoku (I[5,3,4,6,7,8,9,1,2], 49 50 [6,7,2,1,9,5,3,4,8] [1,9,8,3,4,2,5,6,7] [8,5,9,7,6,1,4,2,3] [4,2,6,8,5,3,7,9,1],1 [1,1,3,9,2,4,8,5,6]八 [9,6,1,5,3,7,2,8,4], [2,8,7,4,1,9,6,3,51,1 52 53 54 56

main.py 45 46 print (checkSudoku( [05,3,4,6,7,8,9,1,2],1 48 49 50 [6,7,2,1,9,5,3,4,8], [1,9,8,3,4,2,5,6,7]八 [8,5,9,7,6,1,4,2,3], [4,2,6,8, 5,3,7,9,1]八 [7,1,3,9,2,4,8,5,6] [9,6,1,5,3,7,2,8,4] [2,8,7,4,1,9,6,3,5],V 52 53 54 56 57 58 print (checkSudoku (L5,3,4,6,7,8,9,1,2],1 59 60 61 62 63 64 65 [6,7,2,1,9,5,3,4,8] [1,9,8,3,4,2,4,6,7] [8,5,9,7,6,1,5,2,3]八 [4,2,6,8,5,3,7,9,1]八 [7,1,3,9,2,4,8,5,6] [9,6,1,5,3,7,2,8,4],1 [2,8,7,4,1,9,6,3,5い True False