Sudoku Solver: Data Structures and Search Optimizations
Core Data Structures for Sudoku Solving When implementing a Sudoku solver, the key decision is how to represent placement constraints. A naive approach uses a 3D boolean array can[i][j][num] to indicate whether a number can be placed at position (i, j). While intuitive, this representation has a cri...