1. World Cube Association. Official results (2010), http://www.worldcubeassociation.org/results/
2. Cook, S.A.: Can computers routinely discover mathematical proofs? Proceedings of the American Philosophical Society 128(1), 40–43 (1984)
3. Driscoll, J.R., Furst, M.L.: On the diameter of permutation groups. In: Proceedings of the 15th Annual ACM Symposium on Theory of computing, pp. 152–160 (1983)
4. Drucker, A., Erickson, J.: Is optimally solving the n ×n ×n Rubik’s Cube NP-hard? Theoretical Computer Science — Stack Exchange post (August-September 2010), http://cstheory.stackexchange.com/questions/783/isoptimally-solving-the-nnn-rubiks-cube-np-hard
5. Even, S., Goldreich, O.: The minimum-length generator sequence problem is NP-hard. Journal of Algorithms 2(3), 311–313 (1981)