A Note on Perfect Square Placement
Beldiceanu, Nicolas ; Bourreau, Eric ; Simonis, H
HAL, hal-01245074 / Harvested from HAL
Text on HAL
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.
Publié le : 1999-07-04
Classification:  [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI],  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-01245074,
     author = {Beldiceanu, Nicolas and Bourreau, Eric and Simonis, H},
     title = {A Note on Perfect Square Placement},
     journal = {HAL},
     volume = {1999},
     number = {0},
     year = {1999},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-01245074}
}

Beldiceanu, Nicolas; Bourreau, Eric; Simonis, H. A Note on Perfect Square Placement. HAL, Tome 1999 (1999) no. 0, . http://gdmltest.u-ga.fr/item/hal-01245074/