Fast Global Filtering for Eternity IIReportar como inadecuado

Fast Global Filtering for Eternity II - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 COCONUT - Agents, Apprentissage, Contraintes LIRMM - Laboratoire d-Informatique de Robotique et de Microélectronique de Montpellier 2 BOUYGUES - e-lab Bouygues SA

Abstract : In this paper we consider the enumeration of all solutions of a 2D edge-matching puzzle. We show that a judicious modeling of the problem, combined with the use of appropriate data structures allows obtaining an effective filtering algorithm with complexity O1 at each node of tree search. Our experiments show the relevancy of the proposed power-complexity trade-off, compared to the results of some of the best available brute force tree search algorithms and to classical Constraint Programming models.

Keywords : Edge-matching puzzles Alldifferent Backjumping

Autor: Eric Bourreau - Thierry Benoist -



Documentos relacionados