Sudoku solver
Solving Puzzles My sudoku solving agent is setup as a constraint satisfaction problem where each cell on a sudoku grid are the variables and the variables’ domains are the integers 1-9 inclusive. Each variable is constrained by a set of three alldiff constraints: row alldiff, column alldiff, and 3x3 box alldiff. This problem is pretty well defined in the book we used in this class (Artificial Intelligence: A Modern Approach Fourth Edition by Russell Norvig) as an example of something, in its simplest case, that can be solved by reducing all of the variables’ domains down to one value. However, in the more complex cases, some of the variables’ domains have limits to how far their domains can be reduced by domain propagation. ...