An evolutionary-based hyper-heuristic approach for the Jawbreaker puzzle

Authors:
S. Salcedo-Sanz;J. M. Matías-Román;S. Jiménez-Fernández;A. Portilla-Figueras;L. Cuadra
Affiliations:
Department of Signal Theory and Communications, Escuela Politécnica Superior, Universidad de Alcalá, Madrid, Spain;Department of Signal Theory and Communications, Escuela Politécnica Superior, Universidad de Alcalá, Madrid, Spain;Department of Signal Theory and Communications, Escuela Politécnica Superior, Universidad de Alcalá, Madrid, Spain;Department of Signal Theory and Communications, Escuela Politécnica Superior, Universidad de Alcalá, Madrid, Spain;Department of Signal Theory and Communications, Escuela Politécnica Superior, Universidad de Alcalá, Madrid, Spain
Venue:
Applied Intelligence
Year:
2014

Citing 27
Cited 0

Using a Computer Game to Develop Advanced AI

Computer
Applying Inexpensive AI Techniques to Computer Games

IEEE Intelligent Systems
Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
Modelling and solving English Peg Solitaire

Computers and Operations Research
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Application of reinforcement learning to the game of Othello

Computers and Operations Research
A comprehensive analysis of hyper-heuristics

Intelligent Data Analysis
Single-Player Monte-Carlo Tree Search

CG '08 Proceedings of the 6th international conference on Computers and Games
Efficient solutions for Mastermind using genetic algorithms

Computers and Operations Research
A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand

INFORMS Journal on Computing
Harnessing parallel disks to solve Rubik's cube

Journal of Symbolic Computation
Solving Nonograms by combining relaxations

Pattern Recognition
Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind

Applied Soft Computing
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics

IEEE Transactions on Evolutionary Computation
Integrating neural networks and logistic regression to underpin hyper-heuristic search

Knowledge-Based Systems
Multi-objective optimization of a stacked neural network using an evolutionary hyper-heuristic

Applied Soft Computing
Evolutionary computation and games

IEEE Computational Intelligence Magazine
Teaching Advanced Features of Evolutionary Algorithms Using Japanese Puzzles

IEEE Transactions on Education
A graph coloring constructive hyper-heuristic for examination timetabling problems

Applied Intelligence
Single-player Monte-Carlo tree search for SameGame

Knowledge-Based Systems
Solving Japanese nonograms by Taguchi-based genetic algorithm

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

Journal of Mathematical Modelling and Algorithms
A genetic programming approach to hyper-heuristic feature selection

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Multi objective learning classifier systems based hyperheuristics for modularised fleet mix problem

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Adaptive selection of heuristics for assigning time slots and rooms in exam timetables

Applied Intelligence
Population based Local Search for university course timetabling problems

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a hyper-heuristic algorithm is designed and developed for its application to the Jawbreaker puzzle. Jawbreaker is an addictive game consisting in a matrix of colored balls, that must be cleared by popping sets of balls of the same color. This puzzle is perfect to be solved by applying hyper-heuristics algorithms, since many different low-level heuristics are available, and they can be applied in a sequential fashion to solve the puzzle. We detail a set of low-level heuristics and a global search procedure (evolutionary algorithm) that conforms to a robust hyper-heuristic, able to solve very difficult instances of the Jawbreaker puzzle. We test the proposed hyper-heuristic approach in Jawbreaker puzzles of different size and difficulty, with excellent results.