In the Media

New Scientist reporter Evelyn Wang writes that a study by MIT researchers finds that, “the question of whether a scrambled Rubik’s cube of any size can be solved in a given number of moves is what’s called NP-complete – that’s maths lingo for a problem even mathematicians find hard to solve.”