Submitted by rokicki on Tue, 04/29/2008 - 13:45.
After solving more than 200,000 cosets, we have been able to show that every position of Rubik's cube can be solved in 23 or fewer turns
The key contribution for this new result was 7.8 core-years of CPU time contributed by John Welborn and Sony Pictures Imageworks, using idle time on the render farm that was used for pictures such as Spider-Man 3 and Surf's Up.
No distance 21 positions were found in this search, despite solving a total of more than four million billion cube positions.
The same techniques for the proof of twenty-five moves were used, just on many more computers.
To prove 22 would require, using this technique, solving somewhere between 1 and 1.5 million cosets. We are investigating refinements to our techniques to reduce the CPU time required.