During my prep for the upcoming exam in theoretical informatics I stumbled upon this Paper with the proof that Tetris is NP-Complete.  An unsual way to apply theory to practise