| license: mit | |
| language: | |
| - fr | |
| - en | |
| Sudoku_i=[i,j] | |
| i,j integer | |
| for i in range (0,9,1): | |
| for j in range (9,0,-1): | |
| if Sudoku_i[j]= Sudoku_i[9-j+1] | |
| return redundancy. | |
| else: return row_i | |
| for i in range(0,9,3): | |
| for j in range (9,0,-3): | |
| if Sudoko_i[i]= Sudoku_i[j]: | |
| i= i+1-i.div(9)×i | |
| j= j-1-j.div(9)×j | |
| return One call per line. | |