Raphael Collet wrote: > However the propagation in some examples may indeed reduce generation to > nothing. Renaud De Landtsheer wrote a small solver for a Sudoku with > Regin's alldiff constraint (FD.distinctD). Surprisingly, search > (generation) is rarely needed to solve this problem, which suggests that > this is not really a hard problem ;-) > http://www2.info.ucl.ac.be/ingidocs/people/rdl/sudoku/solvingsudoku.html
Examples of Sudoku that you typically find in newspaper puzzle columns, etc. are usually constructed not to require search. <http://en.wikipedia.org/wiki/Sudoku> -- David Hopwood <[EMAIL PROTECTED]> _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
