{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:27Z","timestamp":1750307967338,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:00:00Z","timestamp":1185667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,7,29]]},"DOI":"10.1145\/1277548.1277581","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"235-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Twenty-six moves suffice for Rubik's cube"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Kunkle","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA"}]},{"given":"Gene","family":"Cooperman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}]}],"member":"320","published-online":{"date-parts":[[2007,7,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"367","volume-title":"Algebraic Algorithms and Error-Correcting Codes, International Conference","author":"Cooperman Gene","year":"1990","unstructured":"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 . 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."},{"key":"e_1_3_2_1_2_1","volume-title":"Handbook of Cubik Math","author":"Frey Alexander H.","year":"1982","unstructured":"Alexander H. Frey , Jr. and David Singmaster . Handbook of Cubik Math . Enslow Publishers , 1982 . Alexander H. Frey, Jr. and David Singmaster. Handbook of Cubik Math. Enslow Publishers, 1982."},{"key":"e_1_3_2_1_3_1","volume-title":"http:\/\/kociemba.org\/cube.htm","author":"Kociemba Herbert","year":"2006","unstructured":"Herbert Kociemba . Cube Explorer . http:\/\/kociemba.org\/cube.htm , 2006 . Herbert Kociemba. Cube Explorer. http:\/\/kociemba.org\/cube.htm, 2006."},{"key":"e_1_3_2_1_4_1","first-page":"21","volume-title":"Proceedings of the Workshop on Computer Games (W31)","author":"Korf Richard","year":"1997","unstructured":"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 . 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."},{"key":"e_1_3_2_1_5_1","unstructured":"Silviu Radu. Rubik can be solved in 27f. http:\/\/cubezzz.homelinux.org\/drupal\/?q=node\/view\/53 2006.  Silviu Radu. Rubik can be solved in 27f. http:\/\/cubezzz.homelinux.org\/drupal\/?q=node\/view\/53 2006."},{"key":"e_1_3_2_1_6_1","unstructured":"Michael Reid. New upper bounds. http:\/\/www.math.rwth-aachen.de\/~Martin.Schoenert\/Cube-Lovers\/michael_reid_new_upper_bounds.html 1995.  Michael Reid. New upper bounds. http:\/\/www.math.rwth-aachen.de\/~Martin.Schoenert\/Cube-Lovers\/michael_reid_new_upper_bounds.html 1995."},{"key":"e_1_3_2_1_7_1","unstructured":"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.  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."}],"event":{"name":"ISSAC07: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Waterloo Ontario Canada","acronym":"ISSAC07"},"container-title":["Proceedings of the 2007 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277548.1277581","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1277548.1277581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:13Z","timestamp":1750258693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277548.1277581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,29]]},"references-count":7,"alternative-id":["10.1145\/1277548.1277581","10.1145\/1277548"],"URL":"https:\/\/doi.org\/10.1145\/1277548.1277581","relation":{},"subject":[],"published":{"date-parts":[[2007,7,29]]},"assertion":[{"value":"2007-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}