Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-28T08:00:50.031Z Has data issue: false hasContentIssue false
  • English
  • Français

How to lose at Tetris

Published online by Cambridge University Press:  01 August 2016

Heidi Burgiel
Heidi Burgiel*
Affiliation:
Department of Mathematics, Statistics, and Computer Science, m/c 249, University of Illinois at Chicago, 851 South Morgan St., Chicago, IL 60607-7045 The Geometry Center, 1300 South Second Street, Minneapolis, MN 55454, USA
Get access Rights & Permissions [Opens in a new window]

Extract

Tetris is a computer game which has obsessed many computer users and attracted much attention, despite the simplicity of its rules. This paper addresses the question: ‘can you “win” the game Tetris?’

Designed by Soviet mathematician Alexey Pazhitnov in the late eighties and imported to the United States by Spectrum Holobyte, Tetris won a record number of software awards in 1989. Versions of Tetris are sold for most personal computers. There are Tetris arcade games, Tetris Nintendo cartridges, and hand-held Tetris games; Tetris has been played on machines ranging from mainframes to calculators. The game's success has prompted the invention of several similar games, including Hextris, Welltris, and Wordtris.

Type
Articles
Information
The Mathematical Gazette , Volume 81 , Issue 491 , July 1997 , pp. 194 - 200
Copyright
Copyright © The Mathematical Association 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Lockwood, R., The Game that managers play, Personal Computing (October 1989) pp. 158–159.Google Scholar
2. Golomb, S.W., Polyominoes, Charles Scribner’s Sons, New York (1965).Google Scholar
3. Grünbaum, B. and Shephard, G.C., Tilings and patterns, W.H. Freeman and Company, New York (1987).Google Scholar
4. Martin, G.E., Polyominoes: A guide to puzzles and problems in tiling, The Mathematical Association of America (1991).Google Scholar
5. Walkup, D.W., Covering a rectangle with T-tetrominoes, Amer. Math, Monthly 72 (1965) pp. 986–988.CrossRefGoogle Scholar
6. Brzustowski, J., Can you win at Tetris?, Masters’ Thesis, The University of British Columbia (March 1992).Google Scholar