Skip Navigation

Scout Archives

Home Projects Publications Archives About Sign Up or Log In

Tetris is Hard, Even to Approximate

Although the Tetris video game may not seem like a normal topic of study for three MIT researchers, it served as the basis for an interesting paper that the group submitted to two conferences, as well as attracting the attention of news publications like Science News and Scientific American. The paper, which mathematically proves the computational complexity of the game, can be downloaded from this Web site. The authors used over 50 pages, including appendices, to formulate the problem and derive several necessary theorems. Links to the online news articles that discuss this unusual work are also provided on this site.
Alternate Title
Paper by Erik D. Demaine
Archived Scout Publication URL
Data Type
Language
Date of Scout Publication
October 24th, 2003
Date Of Record Creation
October 23rd, 2003 at 12:08pm
Date Of Record Release
October 23rd, 2003 at 12:08pm
Resource URL Clicks
3

Internal

Cumulative Rating
0
Add Comment

Comments

(no comments available yet)