‘God’s Number’ hits a new low
What is God’s Number? It’s a phrase coined in 1982 to describe the minimum number of moves to solve any disordered Rubik’s Cube, the puzzle that swept the globe in the early ’80s. The smallest number that had previously been proven was 27, but two researchers at Boston’s Northeastern University, graduate student Dan Kunkle and Professor Gene Cooperman, have used supercomputers to show that 26 is the new minimum - and they hope to push that number lower.
”We don’t yet have a proof that 25 moves suffice, but we have several new directions to try that we hope will get us there before the end of the year,” said Kunkle in an interview with the London Daily Telegraph. Theoretical research indicates God’s Number will turn out to be in the low twenties, but proving it is another matter.
There are 43 billion billion possible Rubik’s cube positions; using brute force, the problem would take far too long to solve even for a supercomputer that can analyze 100 million configurations per second. Kunkle and Cooperman’s approach was to break the puzzle down into two steps. Rather than ask the computer to fully solve the puzzle, they programmed it simply to find one of 15,000 known partial solutions, each of which would then only require a few moves to finish. Using this method, most random cube configurations could be shown to be solvable in 26 moves or less, but a few special configurations still required as many as 29. The researchers then focused on that problematic minority, and one by one were able to prove that each one of them could actually be solved in less than 26 moves.
The findings were announced at the International Symposium on Symbolic and Algebraic Computation in Ontario, Canada.