Bryan writes “The number of moves necessary to solve an arbitrary Rubik’s cube configuration has been cut down to 23 moves, according to an update on Tomas Rokicki’s homepage (and here). As reported in March, Rokicki developed a very efficient strategy for studying cube solvability, which he used it to show that 25 moves are sufficient to solve any (solvable) Rubik’s cube. Since then, he’s upgraded from 8GB of memory and a Q6600 CPU, to the supercomputers at Sony Pictures Imageworks (his latest result was produced during idle-time between productions). Combined with with some of Rokicki’s earlier work, this new result implies that for any arbitrary cube configuration, a solution exists in either 21, 22, or and 23 moves. This is in agreement with informal group-theoretic arguments (see Hofstadter 1996, ch. 14) suggesting that the necessary and sufficient number of moves should be in the low 20′s. From the producers of Spiderman 3 and Surf’s Up, we bring you: 2 steps closer to God’s Algorithm!”
Read more of this story at Slashdot.
