A team of researchers has shown recently that every position of the Rubik's Cube™ can be solved in 20 moves or less. The team members are Morley Davidson, a mathematician from Kent State University, John Dethridge, an engineer at Google in Mountain View, Herbert Kociemba, math teacher from Darmstadt, Germany, and Tomas Rokicki, a programmer from Palo Alto, California.
The best solution know to date was Tomas Rokicki solution. He announced in August 2008 that he had a proof that the Rubik's Cube™ could be solved in 22 moves or less.
A Rubik's Cube™ has 43,252,003,274,489,856,000 positions. To help solving this problem, the team asked Google to donate the idle computer time from their computer systems, and it took a few weeks to get the solution. The time needed to solve the problem was equivalent to 35 years of CPU time in a desktop computer.
More information about Rubik's Cube™ solution in the cube20.org site.
No comments:
Post a Comment