The ultimate solution to the Rubik's cube has come closer thanks to hours of number crunching on a supercomputer.

The research has proved that a Rubik's cube can be returned to its original state in no more than 26 moves. The supercomputer took 63 hours to crank out the proof which goes one better than the previous best solution.

The two computer scientists behind the research project believe that with more work they could push the move count even lower.

It took some smart thinking by graduate student Daniel Kunkle and Gene Cooperman from Northeastern University in Boston to come up with the proof because cranking through the 43 billion billion possible Rubik's cube positions would take too long even for a supercomputer.

Instead, the scientists used a two-step technique in their calculations. Initially, they programmed the supercomputer to arrive at one of 15,000 half-solved solutions. They knew they could fully solve any of these 15,000 cubes with a few extra moves.

The results showed that any disordered cube could be fully solved in a maximum of 29 moves, but that most cubes took 26 moves or fewer.

The researchers then focused on the small number of "problem" configurations that required more than 26 moves. Because there were so few "problem" configurations, the researchers could use the supercomputer to search for the best way to fully solve these cubes.

As it turned out the supercomputer was able to fully solve all of these special cases in fewer than 26 moves.
The study brings scientists one step closer to finding the so-called "God's Number" which is the minimum number of moves needed to solve any disordered Rubik's cube.

It is so named because God would only need the smallest number of moves to solve a cube. Theoretical work suggests that God's Number is in the "low 20s".