Design and Comparison of two Evolutionary Approaches for Solving the Rubik's Cube

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 Rubiks Cube. One being based on the work of Michael Herdy using predefined swapping and flipping algorithms, the other adapting the Thistlethwaites 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, quality function and mutation operators. Finally, both methods are benchmarked and compared to enable an interesting view of solution space size and exploration/eploitation in regard to the Rubik’s Cube.

• Type: Journal
• Year: 2010
• Where: PPSN
• Authors: Nail El-Sourani, Markus Borschbach
• Keywords: Distributed And Parallel Computing, Evolutionary Algorithms, Multiobjective Optimization Problem, PPSN 2010, Rubik’s Cube