Design and comparison of two evolutionary approaches for solving the Rubik's cube

Authors:
Nail El-Sourani;Markus Borschbach
Affiliations:
University of Applied Sciences, Faculty of Computer Science, Bergisch Gladbach, Germany;University of Applied Sciences, Faculty of Computer Science, Bergisch Gladbach, Germany
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 1
Cited 2

An evolutionary approach for solving the rubik's cube incorporating exact methods

EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I

Introduction of a mutation specific fast non-dominated sorting GA evolved for biochemical optimizations

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Impact of different recombination methods in a mutation-specific MOEA for a biochemical application

EvoBIO'13 Proceedings of the 11th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solutions calculated by Evolutionary Algorithms have come to surpass exact methods for solving various problems. The Rubik's Cube multiobjective optimization problem is one such area. In this paper we design, benchmark and compare two different evolutionary approaches to solve the Rubik's Cube. One is based on the work of Michael Herdy using predefined swapping and flipping algorithms, the other adapting the Thistlethwaite Algorithm. The latter is based on group theory, transforming the problem of solving the Cube into four subproblems. We give detailed information about realizing those Evolutionary Algorithms regarding selection method, fitness function and mutation operators. Finally, both methods are benchmarked and compared to enable an interesting view of solution space size and exploration/exploitation in regard to the Rubik's Cube.