Harnessing parallel disks to solve Rubik's cube

Journal of Symbolic Computation

Volumn 44, Issue 7, 2009, Pages 872-890

  Kunkle, Daniel ^a   Cooperman, Gene ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Cosets; Disk based computation; Fast multiplication; Parallel computation; Permutation groups; Rubik's cube

Indexed keywords

EID: 64249150596     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2008.04.013     Document Type: Article

References (19)

1. Cooperman G. TOP-C: A Task-Oriented Parallel C interface. 5th International Symposium on High Performance Distributed Computing. HPDC-5 (1996), IEEE Press 141-150. http://www.ccs.neu.edu/home/gene/topc.html software at: http://www.ccs.neu.edu/home/gene/topc.html
2. Cooperman G., Finkelstein L., and Sarawagi N. Applications of Cayley graphs. AAECC: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, International Conference. LNCS (1990), Springer-Verlag 367-378
3. Frey Jr. A.H., and Singmaster D. Handbook of Cubik Math (1982), Enslow Publishers
4. Isaacs, S., 1981. Lower bounds. http://www.math.rwth-aachen.de/~Martin.Schoenert/Cube-Lovers/Stan_Isaacs__lower_bounds.html
5. Kociemba, H., 2007. Cube Explorer. http://kociemba.org/cube.htm
6. Korf, R., 1997. Finding optimal solutions to Rubik's cube using pattern databases. In: Proceedings of the Workshop on Computer Games (W31) at IJCAI-97, Nagoya, Japan, pp. 21-26
7. Korf R.E. Best-first frontier search with delayed duplicate detection. AAAI (2004) 650-657
8. Korf R.E., and Schultze P. Large-scale parallel breadth-first search. AAAI (2005) 1380-1385
9. Kunkle D., and Cooperman G. Twenty-six moves suffice for Rubik's cube. ISSAC '07: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation (2007), ACM, New York, NY, USA 235-242
10. Radu, S., 2006. Rubik can be solved in 27f. http://cubezzz.homelinux.org/drupal/?q=node/view/53
11. Reid, M., 1995a. New upper bounds. http://www.math.rwth-aachen.de/~Martin.Schoenert/Cube-Lovers/michael_reid__new_upper_bounds.html
12. Reid, M., 1995b. Superflip requires 20 face turns. http://www.math.rwth-aachen.de/~Martin.Schoenert/Cube-Lovers/michael_reid__superflip_requires_20_face_turns.html
13. Robinson E., and Cooperman G. A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups. Proc. of International Symposium on Symbolic and Algebraic Computation. ISSAC '06 (2006), ACM Press 298-305
14. Robinson E., Kunkle D., and Cooperman G. A comparative analysis of parallel disk-based methods for enumerating implicit graphs. PASCO '07: Proceedings of the 2007 International Workshop on Parallel Symbolic Computation (2007), ACM, New York, NY, USA 78-87
15. Robinson E., Müller J., and Cooperman G. A disk-based parallel implementation for direct condensation of large permutation modules. ISSAC'07: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation (2007), ACM, New York, NY, USA 315-322
16. Rokicki, T., 2008a. Twenty-five moves suffice for Rubik's cube. http://arxiv.org/abs/0803.3435
17. Rokicki, T., 2008b. Twenty-three moves suffice. http://cubezzz.homelinux.org/drupal/?q=node/view/117
18. Winter, D.T., 1992. Kociemba's algorithm. http://www.math.rwth-aachen.de/~Martin.Schoenert/Cube-Lovers/Dik_T._Winter__Kociemba's_algorithm_(3).html
19. Zhou R., and Hansen E.A. Structured duplicate detection in external-memory graph search. AAAI (2004) 683-689