|
Tetris is NP-complete
|
Research
|
By Anonymous Hero
from the complexity department
Posted Sun Nov 03, 2002 at 08:12:50 PM PDT
|
|
Erik D. Demaine, Susan Hohenberger, and David Liben-Nowell of the Massachusetts Institute of Technology's Laboratory for Computer Science have analyzed Tetris from a computational perspective, focusing on the computer resources required to play the game successfully.
Tetris, along with other games such as Minesweeper, falls into the NP-complete category.
You can read the full story at Science News Online.
Post a Comment
|
|
|
