Thursday, April 5, 2007

Rubik's cube news

Got an email from Gene Cooperman (CS Prof at Northeastern) a few days ago saying that he and some colleagues have shown that 26 moves (in the face-turn metric) suffice to solve Rubik's cube (the previous best upper bound is 27; lower bound is 20 - the superflip position). They used 7 terabytes of distributed disk space (I gotta get me one of those machines) and will be presenting their research at ISSAC-07.

1 comment:

david joyner said...

The column
http://zone.ni.com/devzone/cda/tut/p/id/5533
reports using a computer algorithm with an interface to a webcam and a robot to solve the cube. Gene Cooperman asked Dan Kunkle (another CS Prof at Northeastern U), who conjectured they used Cube Explorer, which, he says, has a built-in interface for webcams and color recognition of the facelets. Very cool!