A guide-and-observe hyper-heuristic approach to the Eternity II puzzle
zbMath1306.90186MaRDI QIDQ5891176
Wim Vancroonenburg, Tony Wauters, Greet vanden Berghe
Publication date: 26 September 2013
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
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 (2)
Uses Software
Cites Work
- 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
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: A guide-and-observe hyper-heuristic approach to the Eternity II puzzle