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 work we present an evolutionary approach to solve the Rubik’s Cube with a low number of moves by building upon the classic Thistlethwaite’s approach. We provide a group theoretic analysis of the subproblem complexity induced by Thistlethwaite’s group transitions and design an Evolutionary Algorithm from the ground up including detailed derivation of our custom fitness functions. The implementation resulting from these observations is thoroughly tested for integrity and random scrambles, revealing performance that is competitive with exact methods without the need for pre-calculated lookup-tables.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borschbach, M., Grelle, C.: Empirical Benchmarks of a Genetic Algorithm Incorporating Human Strategies. Technical Report, University of Applied Sciences, Bergisch Gladbach (2009)
Boyzejko, W., Wodecki, M.: A Hybrid Evolutionary Algorithm for some Discrete Optimization Problems. In: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications, pp. 326–331. IEEE Computer Society, Washington (2005)
El-Sourani, N.: Design and Benchmark of different Evolutionary Approaches to Solve the Rubiks Cube as a Discrete Optimization Problem. Diploma Thesis, WWU Muenster, Germany (2009)
Florios, K., Mavrotas, G., Diakoulaki, D.: Solving Multiobjective, Multiconstraint Knapsack Problems Using Mathematical Programming and Evolutionary Algorithms. European Journal of Operational Research 203, 14–21 (2009)
Frey, A., Singmaster, D.: Handbook of Cubic Math. Enslow, Hillside (1982)
Herdy, M., Patone, G.: Evolution Strategy in Action, 10 ES-Demonstrations. Technical Report, International Conference on Evolutionary Computation (1994)
Kociemba, H.: Cube Explorer, http://kociemba.org/Cube.htm
Muehlenbein, H., Mahnig, T.: FDA - A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions. Evol. Comput. 7, 353–376 (1999)
Reid, M.: Cube Lovers Mailing List, http://www.math.rwth-aachen.de/~Martin.Schoenert/Cube-Lovers/Index_by_Author.html
Rokicki, T.: Twenty-Five Moves Suffice for Rubik’s Cube, http://Cubezzz.homelinux.org/drupal/?q=node/view/121
Rokicki, T.: http://www.newscientist.com/article/mg19926681.800-cracking-the-last-mystery-of-the-rubiks-Cube.html
Singmaster, D.: Notes on Rubik’s Magic Cube. Enslow, Hillside (1981)
Thistlethwaite, M.B.: The 45-52 Move Strategy. London CL VIII (1981)
Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. Penn State (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El-Sourani, N., Hauke, S., Borschbach, M. (2010). An Evolutionary Approach for Solving the Rubik’s Cube Incorporating Exact Methods. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12239-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-12239-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12238-5
Online ISBN: 978-3-642-12239-2
eBook Packages: Computer ScienceComputer Science (R0)