Tetris is NP-Hard

I got slightly distracted by the October 2002 Gimboland archive, and came across something which might be of interest to my students, or even my colleagues: Tetris is NP-Hard. Here’s the accompanying paper from MIT. For the uninitiated, here’s an explanation of NP-Hard, not that you might be any wiser after reading it.