Efficiently solving Rubik Cubes of any size
Updated: 2011-06-30 18:34:55
skip to main skip to sidebar Pages Home Timeslide View Flipcard June 30, 2011 Efficiently solving Rubik Cubes of any size Erik Demaine , an associate professor of computer science and engineering at MIT his father , Martin , Demaine a visiting scientist at MIT’s Computer Science and Artificial Intelligence Laboratory graduate student Sarah Eisenstat Anna Lubiw , who was Demaine’s PhD thesis adviser at the University of Waterloo and Tufts graduate student Andrew Winslow showed that the maximum number of moves required to solve a Rubik’s cube with N squares per row is proportional to N2 log N . That that’s the answer , and not N2, is a surprising thing , 8221 Demaine . says The standard way to solve a Rubik’s cube , Demaine explains , is to find a square that’s out of position and move it