no code implementations • 11 Apr 2013 • Denis Berthier
Many real world problems naturally appear as constraints satisfaction problems (CSP), for which very efficient algorithms are known.
no code implementations • 11 Apr 2013 • Denis Berthier
In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP).
no code implementations • 5 Apr 2013 • Denis Berthier
Sudoku is used as the main example throughout the book, making it also an advanced level sequel to "The Hidden Logic of Sudoku" (another book by the same author), with: many examples of relationships among different rules and of exceptional situations; comparisons of the resolution potential of various families of rules; detailed statistics of puzzles hardness; analysis of extreme instances.