As a child of the 1990s, I couldn’t avoid the game-turned-best-seller Tetris. Launched in 1984 by Russian programmer Alexey Pajitnov, Tetris quickly became a blockbuster and has had hundreds of ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

If you thought solving a Rubik’s cube was difficult, you were right and maths can back you up. A recent study shows that the question of whether a scrambled Rubik’s cube of any size can be solved in a ...