Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. This paper studies edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ansótegui, C., Béjar, R., Fernàndez, C., & Mateu, C. (2008). Edge matching puzzles as hard SAT/CSP benchmarks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 560–565). https://doi.org/10.1007/978-3-540-85958-1_42
Mendeley helps you to discover research relevant for your work.