A Note on Perfect Square Placement

Nicolas Beldiceanu (1, 2) , Eric Bourreau (3) , Helmut Simonis (4)

1 TASC - Theory, Algorithms and Systems for Constraints
2 LINA - Laboratoire d'Informatique de Nantes Atlantique
3 COSYSTEC SA [Orsay]
4 4C UCC - Cork Constraint Computation Centre

In this note we describe the solution of perfect square placement problems with CHIP. A set of 207 perfect square placement problems from [BD92] is used. We present the constraint model in CHIP, which uses the global constraints diffn and cumulative together with a specific labeling routine for perfect placement problems. We show that all problems can be solved and present backtracking count and execution times for finding the first solution and for exploring the complete search space.

Domaines: Intelligence artificielle [cs.AI]; Combinatoire [math.CO]

Nicolas Beldiceanu, Eric Bourreau, Helmut Simonis. A Note on Perfect Square Placement. 1999. ⟨hal-01245074⟩