Abstract
The present paper considers the optimisation version of the Eternity II puzzle problem and unsigned edge matching puzzles in general. The goal of this optimisation problem is to maximise the number of matching edges in the puzzle. In 2010, the META Eternity II contest awarded the best performing metaheuristic approach to this hard combinatorial optimisation problem. The winning hyper-heuristic of the contest is subject of this paper. Heuristic design decisions are motivated based on the results of extensive experiments. Furthermore, new results for the Eternity II puzzle problem are presented. The main contribution of this paper is the description of a novel guide-and-observe search mechanism combining a set of objectives. The approach significantly outperforms search methods guided by the default objective only.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ansótegui, C., Béjar, R., Fernàndez, C., Mateu, C.: Edge matching puzzles as hard sat/csp benchmarks. In: CP ’08 Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (2008)
Antoniadis, A., Lingas, A.: Approximability of edge matching puzzles. In: Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM ’10, pp. 153–164. Springer, Berlin, Heidelberg (2010)
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, chapter 16, pp. 457–474. Springer, New York (2003)
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A classification of hyper-heuristics approaches. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd ed. International Series in Operations Research & Management Science, vol. 57, chapter 15, pp. 449–468. Springer (2010)
Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9, 451–470 (2003)
Coelho, I., Coelho, B., Coelho, V., Haddad, M., Souza, M., Ochi, L.: A general variable neighborhood search approach for the resolution of the eternity ii puzzle. In: Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing, META’10 (2010)
Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Comb. 23(1), 195–208 (2007)
Dueck, G.: New optimisation heuristics. the great deluge algorithm and record-to-record travel. J. Comput. Phys. 104, 86–92 (1993)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Norwell, MA (1997)
Heule, M.J.H.: Solving edge-matching problems with satisfiability solvers. In: Proceedings of the Second International Workshop on Logic and Search (LaSh 2008) (2008)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science, New Series 220(4598), 671–680 (1983)
Misir, M., Wauters, T., Verbeeck, K., Vanden Berghe, G.: A new learning hyper-heuristic for the traveling tournament problem. In: Proceedings Of The VIII Metaheuristics International Conference (2009)
Muñoz, J., Gutierrez, G., Sanchis, A.: Evolutionary genetic algorithms in a constraint satisfaction problem: Puzzle eternity ii. In: Cabestany, J., Sandoval, F., Prieto, A., Corchado, J. (eds.) Bio-Inspired Systems: Computational and Ambient Intelligence. Lecture Notes in Computer Science, vol. 5517, pp. 720–727. Springer, Berlin, Heidelberg (2009)
Ozcan, E., Misir, M., Ochoa, G., Burke, E.K.: A reinforcement learning—great-deluge hyper-heuristic for examination timetabling. IJAMC 1, 39–59 (2010)
Schaus, P., Deville, Y.: Hybridization of cp and vlns for eternity ii. In: JFPC’08 Quatrième Journées Francophones de Programmation par Contraintes (2008)
Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley (2009)
Vancroonenburg, W., Wauters, T., Vanden Berghe, G.: A two phase hyper-heuristic approach for solving the eternity ii puzzle. In: Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing, META’10 (2010)
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’10 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was originally intended to be published for the META Special issue of Journal of Mathematical Modelling & Algorithms but was published in an earlier issue by mistake in Vol. 11 No. 3 pp. 217–233, DOI 10.1007/s10852-012-9178-4.
Rights and permissions
About this article
Cite this article
Wauters, T., Vancroonenburg, W. & Berghe, G.V. A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. J Math Model Algor 12, 27–43 (2013). https://doi.org/10.1007/s10852-013-9222-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-013-9222-z