Pattern-Based Constraint Satisfaction and Logic Puzzles par BERTHIER, Pr Denis: New (2012)

A propos de cet article

pp. 484.

N� de r�f. du vendeur 26131058340

Contacter le vendeur

Signaler cet article

D�tails bibliographiques

Titre: Pattern-Based Constraint Satisfaction and Logic Puzzles
�diteur: Lulu.com
Date de parution: 2012
Langue: anglais
ISBN � 10 chiffres: 1291203397
ISBN � 13 chiffres: 9781291203394
Reliure: Couverture souple
�tat de l'article: New

A propos de ce titre

Synopsis

"Pattern-Based Constraint Satisfaction and Logic Puzzles" develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of reasoning with the constraints are formalised by various families of "resolution rules", each of them carrying its own notion of simplicity. A large part of the book illustrates the power of the approach by applying it to various popular logic puzzles. It provides a unified view of how to model and solve them, even though they involve very different types of constraints: obvious symmetric ones in Sudoku, non-symmetric but transitive ones (inequalities) in Futoshiki, topological and geometric ones in Map colouring, Numbrix and Hidato, and even much more complex non-binary arithmetic ones in Kakuro. It also shows that the most familiar techniques for these puzzles can indeed be understood as mere application-specific presentations of the general rules.

Pr�sentation de l'�diteur

"Pattern-Based Constraint Satisfaction and Logic Puzzles" develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of reasoning with the constraints are formalised by various families of "resolution rules", each of them carrying its own notion of simplicity. A large part of the book illustrates the power of the approach by applying it to various popular logic puzzles. It provides a unified view of how to model and solve them, even though they involve very different types of constraints: obvious symmetric ones in Sudoku, non-symmetric but transitive ones (inequalities) in Futoshiki, topological and geometric ones in Map colouring, Numbrix and Hidato, and even much more complex non-binary arithmetic ones in Kakuro. It also shows that the most familiar techniques for these puzzles can indeed be understood as mere application-specific presentations of the general rules.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.