A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle

Authors:
Tony Wauters;Wim Vancroonenburg;Greet Vanden Berghe
Affiliations:
CODeS, KAHO Sint-Lieven, Gent, Belgium;CODeS, KAHO Sint-Lieven, Gent, Belgium;CODeS, KAHO Sint-Lieven, Gent, Belgium and Department of Computer Science, K.U.Leuven, Leuven, Belgium
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2013

Citing 8
Cited 0

New optimization heuristics

Journal of Computational Physics
Tabu Search

Tabu Search
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity

Graphs and Combinatorics
Edge Matching Puzzles as Hard SAT/CSP Benchmarks

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Evolutionary Genetic Algorithms in a Constraint Satisfaction Problem: Puzzle Eternity II

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Approximability of Edge Matching Puzzles

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Metaheuristics: From Design to Implementation

Metaheuristics: From Design to Implementation

Quantified Score

Hi-index	0.00

Visualization

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.