Advertisement

Automatically Generating and Solving Eternity II Style Puzzles

  • Geoff Harris
  • Bruce James Vanstone
  • Adrian Gepp
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10868)

Abstract

The Eternity II puzzle is an NP-complete problem. Prior researchers have generated data sets that are similar to the Eternity II problem. These data sets can be created in linear time, but this comes at the cost of easing the problem by introducing exploitable statistical features. The first contribution of this paper is a new method to generate data sets that are truly of Eternity II style. The second contribution is an Eternity II specific implementation of a constraint-satisfaction-problem style algorithm. Unlike most other published algorithms, this one has no form of look-ahead, filtering, forward checking, back jumping or k-consistency checks. Instead, it uses knowledge about the structure of the puzzle and the uniform distribution of edge colours. This approach is up to three orders of magnitude faster than previously published attempts.

Keywords

Eternity II Edge Matching Puzzle Constraint satisfaction problem NP-complete 

References

  1. 1.
    Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Combinatorics 23, 195–208 (2007)MathSciNetCrossRefGoogle Scholar
  2. 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)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Schaus, P., Deville, Y.: Hybridization of CP and VLNS for eternity II. In: Journées Francophones de Programmation par Contraintes (JFPC 20008) (2008)Google Scholar
  4. 4.
    Bourreau, E., Benoist, T.: Fast global filtering for eternity II. Constraint Program. Lett. (CPL) 3, 036–049 (2008)Google Scholar
  5. 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)Google Scholar
  6. 6.
    Wang, W.S., Chiang, T.C.: Solving eternity-II puzzles with a tabu search algorithm. In: Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing (META), vol. 10 (2010)Google Scholar
  7. 7.
    Verhaard, L.: Details of eternity II solver eii (2009). http://www.shortestpath.se/eii/eii_details.html
  8. 8.
    Aaronson, S.: Guest column: NP-complete problems and physical reality. ACM Sigact News 36(1), 30–52 (2005)CrossRefGoogle Scholar
  9. 9.
    Harris, G., Vanstone, B., Gepp, A.: Code and data repository: automatically generating and solving eternity II style puzzles (2018). https://bitbucket.org/bvanston/bag-canadian-conference-2018/src/master/
  10. 10.
    Bessière, C., Régin, J.-C.: MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 61–75. Springer, Heidelberg (1996).  https://doi.org/10.1007/3-540-61551-2_66CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Bond Business SchoolBond UniversityGold CoastAustralia

Personalised recommendations