A guide-and-observe hyper-heuristic approach to the Eternity II puzzle
DOI10.1007/s10852-012-9178-4zbMath1306.90185OpenAlexW1996979969MaRDI QIDQ5919987
Greet vanden Berghe, Wim Vancroonenburg, Tony Wauters
Publication date: 1 August 2013
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-012-9178-4
Programming involving graphs or networks (90C35) Games involving graphs (91A43) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- On the hardness of solving edge matching puzzles as SAT or CSP problems
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups
- Approximability of Edge Matching Puzzles
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle
This page was built for publication: A guide-and-observe hyper-heuristic approach to the Eternity II puzzle