Twenty-Five Moves Suffice for Rubik's Cube
| dc.creator | Rokicki, Tomas | |
| dc.date | 2008-03-24 | |
| dc.date.accessioned | 2026-07-07T09:28:08Z | |
| dc.date.available | 2026-07-07T09:28:08Z | |
| dc.description | How many moves does it take to solve Rubik's Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or more moves; this is a surprisingly large gap. This paper describes a program that is able to find solutions of length 20 or less at a rate of more than 16 million positions a second. We use this program, along with some new ideas and incremental improvements in other techniques, to show that there is no position that requires 26 moves. | |
| dc.identifier | https://arxiv.org/abs/0803.3435 | |
| dc.identifier | http://arxiv.org/abs/0803.3435 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157344 | |
| dc.subject | Symbolic Computation | |
| dc.subject | Discrete Mathematics | |
| dc.title | Twenty-Five Moves Suffice for Rubik's Cube | |
| dc.type | text |