Hi.
Russ Abbott wrote:
> I'm finally getting around to looking at the Sudoku program. I took Raph's
Just as a side note: Helmut Simonis gave a talk about solving Sudoku at one
of this year's CP workshops. He describes some global constraints that make
it possible to solve harder instances without search (obviously
generalisations of the all-diff), and he has categorised the sudoku puzzles
found in several newspapers according to their difficulty. You find the
material (slides and paper) on his homepage.
Cheers,
Guido
--
Guido Tack
Programming Systems Lab, Saarland University
http://www.ps.uni-sb.de/~tack
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
