Publication: Evolutionary techniques in a constraint satisfaction problem: Puzzle Eternity II
Loading...
Identifiers
Publication date
2009
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Impact
Export
Abstract
This work evaluates three evolutionary algorithms in a constraint satisfaction problem. Specifically, the problem is the Eternity II, a edge-matching puzzle with 256 unique square tiles that have to be placed on a square board of 16 times 16 cells. The aim is not to completely solve the problem but satisfy as many constraints as possible. The three evolutionary algorithms are: genetic algorithm, an own implementation of a technique based on immune system concepts and a multiobjective evolutionary algorithm developed from the genetic algorithm. In addition to comparing the results obtained by applying these evolutionary algorithms, they also will be compared with an exhaustive search algorithm (backtracking) and random search. For the evolutionary algorithms two different fitness functions will be used, the first one as the score of the puzzle and the second one as a combination of the multiobjective algorithm objectives. We also used two ways to create the initial population, one randomly and the other with some domain information.
Description
Proceeding of: IEEE Congress on Evolutionary Computation (CEC 2009), May 18-21 (Monday - Thursday), 2009, Trondheim, Norway.
Keywords
Constraint satisfaction problem, Edge-matching puzzle, Exhaustive search algorithm, Genetic algorithms, Immune system concepts, Multiobjective evolutionary algorithms, Puzzle Eternity II, Random search
Bibliographic citation
IEEE Congress on Evolutionary Computation (CEC 2009), IEEE, 2009, p.2985-2991