The Null Device

Tetris is NP-hard

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?

There are no comments yet on "Tetris is NP-hard"

Want to say something? Do so here.

Post pseudonymously

Display name:
URL:(optional)
To prove that you are not a bot, please enter the text in the image into the field below it.

Your Comment:

Please keep comments on topic and to the point. Inappropriate comments may be deleted.

Note that markup is stripped from comments; URLs will be automatically converted into links.