1,848
Views
0
CrossRef citations to date
0
Altmetric
Review

On the performance analysis of solving the Rubik’s cube using swarm intelligence algorithms

ORCID Icon & ORCID Icon
Article: 2138129 | Received 27 Jun 2022, Accepted 13 Oct 2022, Published online: 30 Oct 2022

References

  • Agostinelli, F., S. McAleer, A. Shmakov, and P. Baldi. 2019. Solving the rubik’s cube with deep reinforcement learning and search. Nature Machine Intelligence 1 (8):356–3406. doi:10.1038/s42256-019-0070-z.
  • Amrutha, B., and R. Srinath. 2022. Deep learning models for rubik’s cube with entropy modelling Kumar, Amit, Senatore, Sabrina, Gunjan, Vinit Kumar. In Icdsmla 2020, 35–43. Singapore: Springer.
  • Browne, C. B., E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton. 2012. A survey of monte carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in Games 4 (1):1–43. doi:10.1109/TCIAIG.2012.2186810.
  • Corli, S., L. Moro, D. E. Galli, and E. Prati. 2021. Solving rubik’s cube via quantum mechanics and deep reinforcement learning. Journal of Physics A: Mathematical and Theoretical 54 (42):425302. doi:10.1088/1751-8121/ac2596.
  • Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1):269–71. doi:10.1007/BF01386390.
  • Dorigo, M. 1991. Ant colony optimization—new optimization techniques in engineering. Springer-Verlag Berlin Heidelberg by Onwubolu, GC, and BV Babu 101–17.
  • Dorigo, M., M. Birattari, and T. Stutzle. 2006. Ant colony optimization. IEEE Computational Intelligence Magazine 1 (4):28–39. doi:10.1109/MCI.2006.329691.
  • El-Sourani, N., and M. Borschbach (2010). Design and comparison of two evolutionary approaches for solving the rubik’s cube. In International Conference on Parallel Problem Solving from Nature, Krakov, Poland, pp. 442–51. Springer.
  • El-Sourani, N., S. Hauke, and M. Borschbach (2010). An evolutionary approach for solving the rubik’s cube incorporating exact methods. In European conference on the applications of evolutionary computation, Istanbul, Turkey, pp. 80–89. Springer.
  • Gandomi, A. H., and A. H. Alavi. 2012. Krill herd: A new bio-inspired optimization algorithm. Communications in Nonlinear Science & Numerical Simulation 17 (12):4831–45. doi:10.1016/j.cnsns.2012.05.010.
  • Grol, R. V. (2010, November). The quest for god’s number. Accessed March 2021.
  • Herdy, M., and G. Patone (1994). Evolution strategy in action: 10es-demonstrations (tech. rep. no. 94-05). Berlin, Germany: Technische Universit at Berlin.
  • Hoey, D. (1994). The real size of cube space. Accessed August 2021.
  • Irpan, A. 2016. Exploring boosted neural nets for rubik's cube solving. Berkeley, California: University of California.
  • Johnson, C. G. (2018). Solving the rubik’s cube with learned guidance functions. In 2018 IEEE Symposium Series on Computational Intelligence (SSCI), Bengaluru, India, pp. 2082–89. IEEE.
  • Johnson, C. G. (2019). Stepwise evolutionary learning using deep learned guidance functions. In International Conference on Innovative Techniques and Applications of Artificial Intelligence, Cambridge, United Kingdom, pp. 50–62. Springer.
  • Johnson, C. G. 2021. Solving the rubik’s cube with stepwise deep learning. Expert Systems 38 (3):e12665. doi:10.1111/exsy.12665.
  • Katz, G. E., and N. Tahir. 2022. Towards automated discovery of god-like folk algorithms for rubik’s cube. Proceedings of the AAAI Conference on Artificial Intelligence 36 (9):10210–18. doi:10.1609/aaai.v36i9.21261.
  • Kennedy, J., and R. Eberhart (1995). Particle swarm optimization. In Proceedings of ICNN’95 - International Conference on Neural Networks, Perth, WA, Australia, Volume 4, pp. 1942–48.
  • Kociemba, H. (2014a). Cube explorer 5.01. Accessed March 2021.
  • Kociemba, H. (2014b). Cube explorer 5.12 htm and qtm. Accessed March 2021.
  • Korf, R. E. 1982. A program that learns to solve rubik’s cube. In AAAI (Pittsburgh, Pennsylvania: AAAI Press), 164–67.
  • Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27 (1):97–109. doi:10.1016/0004-3702(85)90084-0.
  • Korf, R. E. 1997. Finding optimal solutions to rubik’s cube using pattern databases. In AAAI/IAAI (Providence, Rhode Island: AAAI Press), 700–05.
  • Lipowski, A., and D. Lipowska. 2012. Roulette-wheel selection via stochastic acceptance. Physica A: Statistical Mechanics and Its Applications 391 (6):2193–96. doi:10.1016/j.physa.2011.12.004.
  • Rokicki, T., H. Kociemba, M. Davidson, and J. Dethridge (2010). God’s number is 20. Accessed March 2021.
  • Rokicki, T., H. Kociemba, M. Davidson, and J. Dethridge. 2014. The diameter of the rubik’s cube group is twenty. SIAM Review 56 (4):645–70. doi:10.1137/140973499.
  • Saeidi, S. 2018. Solving the rubik’s cube using simulated annealing and genetic algorithm. International Journal of Education and Management Engineering 8 (1):1. doi:10.5815/ijeme.2018.01.01.
  • Scherphuis, J. (2015a). Kociemba’s algorithm. Accessed March 2021.
  • Scherphuis, J. (2015b). Thistlethwaite’s 52-move algorithm. Accessed September 2021.
  • Singmaster, D. 1981. Notes on Rubik’s magic cube. London, England: Enslow Pub Inc.
  • Sur, C., and A. Shukla (2014). Discrete krill herd algorithm–a bio-inspired meta-heuristics for graph based network route optimization. In International Conference on Distributed Computing and Internet Technology, Bhubaneswar, India, pp. 152–63. Springer.
  • Thistlethwaite, M. (1981). The 45-52 move strategy. London CL VIII.
  • WCA (2003). World cube assocaiaiton. Accessed March 2021.