Mirrored from Sudopedia, the Free Sudoku Reference Guide
Constraint Satisfaction Problems can be solved using Donald Knuth's Dancing Links algorithm.
Another way to program Sudoku as a constraint satisfaction problem is to treat it as a Binary Integer Linear Program. In that case define
The cell constraint then becomes
The other three constraints can also be set up as linear sums.
Constraint Satisfaction Problem entry on WikipediaThis page was last modified 01:14, 15 April 2009.