Sudoku puzzles form perfect constraint satisfaction problems (CSPs), with a goal of populating a 9x9 grid with 1 through 9, with compliance with specific constraints for rows, columns, and 3x3 blocks.
Abstract: This paper introduces a hybrid method for solving Sudoku puzzles by combining Deep Q-Learning (DQN) with heuristic backtracking. Sudoku is treated as a Constraint Satisfaction Problem (CSP), ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results