Advertisement

An Evolutionary Approach for Solving the Rubik’s Cube Incorporating Exact Methods

  • Nail El-Sourani
  • Sascha Hauke
  • Markus Borschbach
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6024)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Borschbach, M., Grelle, C.: Empirical Benchmarks of a Genetic Algorithm Incorporating Human Strategies. Technical Report, University of Applied Sciences, Bergisch Gladbach (2009)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Frey, A., Singmaster, D.: Handbook of Cubic Math. Enslow, Hillside (1982)Google Scholar
  6. 6.
    Herdy, M., Patone, G.: Evolution Strategy in Action, 10 ES-Demonstrations. Technical Report, International Conference on Evolutionary Computation (1994)Google Scholar
  7. 7.
    Kociemba, H.: Cube Explorer, http://kociemba.org/Cube.htm
  8. 8.
    Muehlenbein, H., Mahnig, T.: FDA - A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions. Evol. Comput. 7, 353–376 (1999)CrossRefGoogle Scholar
  9. 9.
  10. 10.
    Rokicki, T.: Twenty-Five Moves Suffice for Rubik’s Cube, http://Cubezzz.homelinux.org/drupal/?q=node/view/121
  11. 11.
  12. 12.
    Singmaster, D.: Notes on Rubik’s Magic Cube. Enslow, Hillside (1981)Google Scholar
  13. 13.
    Thistlethwaite, M.B.: The 45-52 Move Strategy. London CL VIII (1981)Google Scholar
  14. 14.
    Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. Penn State (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Nail El-Sourani
    • 1
  • Sascha Hauke
    • 1
  • Markus Borschbach
    • 1
  1. 1.Faculty of Computer Science, Chair of Optimized SystemsUniversity of Applied SciencesBergisch GladbachGermany

Personalised recommendations