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.
Subscribe to:
Post Comments (Atom)
Blog Archive
-
►
2008
(12)
- ► 05/25 - 06/01 (1)
- ► 04/13 - 04/20 (1)
- ► 03/30 - 04/06 (1)
- ► 03/23 - 03/30 (2)
- ► 03/16 - 03/23 (3)
- ► 03/02 - 03/09 (1)
- ► 02/17 - 02/24 (1)
- ► 02/10 - 02/17 (1)
- ► 01/27 - 02/03 (1)
-
▼
2007
(20)
- ► 12/30 - 01/06 (1)
- ► 12/16 - 12/23 (1)
- ► 12/09 - 12/16 (2)
- ► 12/02 - 12/09 (1)
- ► 07/29 - 08/05 (1)
- ► 07/22 - 07/29 (1)
- ► 07/15 - 07/22 (1)
- ► 06/24 - 07/01 (1)
- ► 06/03 - 06/10 (2)
- ► 05/20 - 05/27 (4)
- ► 04/15 - 04/22 (2)
- ► 04/08 - 04/15 (2)
1 comment:
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!
Post a Comment