If you’re a fan of playing Rubik’s cube but hate to follow the guide that comes along with it, perhaps its time to switch track to another method – a more sophisticated one.
Scientists led by Erik Demaine of Massachusetts Institute of Technology have found the solution to the Rubik’s Cube, the 3-D mechanical puzzle popularized during the 80s, by developing an algorithm for a computer to do it in 10.69 seconds despite its 43 quintillion probabilities thru a strategy known as “brute force”.
They have envisioned the future use of the algorithm to complex problems by tweaking similarly-structured mathematical data. However, only approximate values of movements required are presently shown and figuring out the exact value still remains to be seen. And the cube should be in its most scrambled state for the algorithm to work.
The idea is grouping cubies to go in one direction reducing the number of movements, termed as the factor of log n, n being the length of one side. And the number of moves to manipulate the cubies to the right spot is represented by n², giving the algorithm of n²/log n, which is proportional to the maximum moves for a cube of side n.
The movement process is called parallelized or moving a group of cubies to the same direction at the same time. Demaine used a 3x3x3 cube to test the algorithm.
You might also like
Story by pinoytutorial