Twenty-six moves suffice for Rubik's cube

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2007, Pages 235-242

  Kunkle, Daniel ^a   Cooperman, Gene ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Disk based methods; Fast multiplication; Permutation groups; Rubik's cube; Upper bound

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; NUMERICAL METHODS; PROGRAM PROCESSORS;

DISK-BASED METHODS; FAST MULTIPLICATION; MATHEMATICAL GROUP; PERMUTATION GROUPS; RUBIK'S CUBE; UPPER BOUND;

PROBLEM SOLVING;

EID: 36348993090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1277548.1277581     Document Type: Conference Paper

References (7)

1. Gene Cooperman, Larry Finkelstein, and Namita Sarawagi. Applications of Cayley graphs. In AAECC: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, International Conference, pages 367-378. LNCS, Springer-Verlag, 1990.
2. Alexander H. Frey, Jr. and David Singmaster. Handbook of Cubik Math. Enslow Publishers, 1982.
3. Herbert Kociemba. Cube Explorer. http://kociemba.org/cube.htm, 2006.
4. Richard Korf. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of the Workshop on Computer Games (W31) at IJCAI-97, pages 21-26, Nagoya, Japan, 1997.
5. Silviu Radu. Rubik can be solved in 27f. http://cubezzz.homelinux.org/ drupal/?q=node/view/53, 2006.
6. Michael Reid. New upper bounds. http://www.math.rwth-aachen.de/-Martin. Schoenert/Cube-Lovers/michael_reid_new_upper_bounds.html, 1995.
7. Michael Reid. Superflip requires 20 face turns. http://www.math.rwth- aachen.de/-Martin.Schoenert/Cube-Lovers/ michael_reid_superflip_requires_20_face_turns.html, 1995.