Automatically Generating and Solving Eternity II Style Puzzles-Reference-Cited by-同舟云学术

Automatically Generating and Solving Eternity II Style Puzzles

Published:2018 Issue: Volume: Page:626-632
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Harris Geoff^ORCID,Vanstone Bruce James^ORCID,Gepp Adrian^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-92058-0_60

Reference10 articles.

1. Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Combinatorics 23, 195–208 (2007)

2. Ansótegui, C., Béjar, R., Fernández, C., Mateu, C.: On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints 18, 1–31 (2013)

3. Schaus, P., Deville, Y.: Hybridization of CP and VLNS for eternity II. In: Journées Francophones de Programmation par Contraintes (JFPC 20008) (2008)

4. Bourreau, E., Benoist, T.: Fast global filtering for eternity II. Constraint Program. Lett. (CPL) 3, 036–049 (2008)

5. Munoz, J., Gutierrez, G., Sanchis, A.: Evolutionary techniques in a constraint satisfaction problem: puzzle eternity II. In: IEEE Congr. Evol. Comput. (CEC 2009), pp. 2985–2991. IEEE (2009)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Variable Transformation to a $$2\times 2$$ Domain Space for Edge Matching Puzzles;Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices;2020

2. Automatically Generating and Solving Eternity II Style Puzzles;Lecture Notes in Computer Science;2018