Scientists develop algorithm to unravel Rubik’s cubes of any size

a pc solving a Rubik’s cube? P’shaw. Doing it in 10.69 seconds ? Been there, record set. But to crack one in every of any size? Color us impressed. Erik Demaine of MIT did just that, developing an algorithm that applies to cubes irrespective of how ambitious their dimensions. Pretty early on, he realized he had to take a unique angle than he would with a typical 3 x 3 x 3 puzzle, which other scientists have tackled by borrowing computers from Google to think of all 43 quintillion possible moves — a technique known simply as “brute force.” As you may imagine, that is not exactly a viable solution if you end up wrestling with an 11 x 11 x 11 cube. So Demaine and his team settled on an approach that’s actually a riff on one commonplace by Rubik’s enthusiasts, who might try and move a square into its desired position while leaving the remainder of the cube as unchanged as possible. That’s a tedious approach to go, for sure, so instead The researchers grouped several cubies that every one had to go inside the same direction, a tactic that reduced the variety of moves by an element of log n, with n representing the length of any of the cube’s sides. Since moving individual cubies into a really perfect spot requires quite a few moves equal to n², the ultimate algorithm is n²/log n. If we just lost you non-math majors with that formula, rest assured that the scientists expect folks cannot apply it directly, per se, though he does say it may help cube-solvers sharpen their strategy. Other that, all you overachievers accessible, you are still by yourself with that 20 x 20 x 20.