Computer scientists at MIT prove that
Tetris is NP-hard; i.e., optimally stacking blocks is in the same class of problems as things like the Travelling Salesman problem, meaning that there is no known way to solve them efficiently. Maybe this means that we'll soon see Tetris-based cryptographic algorithms?