A rubik's cube has approximately 43 quintillion possible configurations, even which a supercomputer takes a long time to unscramble it. However, a computer scientist at Northeastern University in Boston has proved that 26 moves are enough to solve any Rubik's Cube, no matter how scrambled.