Pattern-Based Constraint Satisfaction and Logic Puzzles

04/05/2013
by   Denis Berthier, et al.
0

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 (or Cross Sums). It also shows that the most familiar techniques for these puzzles can indeed be understood as mere application-specific presentations of the general rules. 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/08/1999

Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains

We study here constraint satisfaction problems that are based on predefi...
03/24/2000

Constraint Programming viewed as Rule-based Programming

We study here a natural situation when constraint programming can be ent...
04/11/2013

From Constraints to Resolution Rules, Part II: chains, braids, confluence and T&E

In this Part II, we apply the general theory developed in Part I to a de...
09/01/2020

Formally Verified Transformation of Non-binary Constraints into Binary Constraints

It is well known in the Constraint Programming community that any non-bi...
04/11/2013

From Constraints to Resolution Rules, Part I: Conceptual Framework

Many real world problems naturally appear as constraints satisfaction pr...
08/30/2011

A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions

In order to give appropriate semantics to qualitative conditionals of th...
10/13/2021

Practice Problems for Hardware Engineers

This book is to help undergraduate and graduate students of electrical a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.