Hierarchical Classifications in Constraint Satisfaction (Second Edition)

"Hierarchical Classifications in Constraint Satisfaction (Second Edition)" defines a universal classification system for the instances of a finite Constraint Satisfaction Problem (CSP). It analyses detailed classification and correlation results for the 9x9 Sudoku CSP and it explores the borders between the different levels of the main classification. Following an analysis of the standard vicinity search technique, it introduces a universal topology on the set of instances of a CSP, for which the above classifications are continuous. It devotes a chapter to the specific problems raised by a recently discovered pattern (the tridagon) due to its exceptional persistency under "small" changes. An appendix presents the three software tools that have been used for all the calculations in the book, so that the reader can easily reproduce and extend them.