def debug_coloring():
sudoku_color.colors[0] = 0
sudoku_color.ncolored = 80
sudoku_color.debug = True
[soln1, soln2] = color_puzzle(2, False)
print_solution(soln1)
print()
print_solution(soln2)
def debug_coloring():
sudoku_color.colors[0] = 0
sudoku_color.ncolored = 80
sudoku_color.debug = True
[soln1, soln2] = color_puzzle(2, False)
print_solution(soln1)
print()
print_solution(soln2)
# g is assumed to be a partial solution
def del_soln():
delns = list(range(81))
ndelns = 0
shuffle(delns)
for v in delns:
save = sudoku_color.colors[v]
sudoku_color.colors[v] = 0
sudoku_color.ncolored = 81 - ndelns - 1
solns = color_puzzle(2, False)
if len(solns) > 1:
sudoku_color.colors[v] = save
else:
ndelns += 1
setrecursionlimit(100)
gen_sudoku_layout()
del_soln()
print_solution(sudoku_color.colors)
def debug_coloring():
sudoku_color.colors[0] = 0
sudoku_color.ncolored = 80
sudoku_color.debug = True
[soln1, soln2] = color_puzzle(2, False)
print_solution(soln1)
print()
print_solution(soln2)
# deletion-based puzzle creation algorithm
# suggested by ksudoku.
# g is assumed to be a partial solution
def del_soln():
delns = list(range(81))
ndelns = 0
shuffle(delns)
for v in delns:
save = sudoku_color.colors[v]
sudoku_color.colors[v] = 0
sudoku_color.ncolored = 81 - ndelns - 1
solns = color_puzzle(2, False)
if len(solns) > 1:
sudoku_color.colors[v] = save
else:
ndelns += 1
setrecursionlimit(100)
gen_sudoku_layout()
del_soln()
print_solution(sudoku_color.colors)
def debug_coloring():
sudoku_color.colors[0] = 0
sudoku_color.ncolored = 80
sudoku_color.debug = True
[soln1, soln2] = color_puzzle(2, False)
print_solution(soln1)
print()
print_solution(soln2)
