Morphology of the tetromino-stacking game: The design evolution of Tetris [Abstract]

نویسنده

  • Will Jordan
چکیده

This essay presents a focused, comprehensive design study of the tetrominostacking computer puzzle game known as Tetris, tracing the structural history and evolution of the game's subtle yet complex mechanics since its invention in 1985. Although the basic algorithm is quite simple and has remained essentially unchanged throughout its history, the enormous variety of implementations and the longevity of its success across many generations of computing platforms has made the tetromino game a diverse practice of evolutionary game design worthy of historical analysis. Instead of producing a full taxonomy or phylogenetic classification of the genre of computer puzzle games derived from or inspired by Tetris (see eg. Juul 2007), my analysis is intentionally restricted to implementations which recognizably reproduce the original basic algorithm. This approach is comparable to historical analyses of Chess, Go and Mancala which attempt to trace the evolution and distribution of a distinct, identifiable gameplaying practice through various successive iterations while maintaining focus on a canonical form.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ct 2 00 2 Tetris is Hard , Even to Approximate

In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row. We prove that in the offline version of Tetris, it is NP-complete to maximize the number of cleared ...

متن کامل

2 Tetris is Hard , Even to Approximate Erik

In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row. We prove that in the offline version of Tetris, it is NP-complete to maximize the number of cleared ...

متن کامل

A steganographic method based on tetris games

Although various steganographic methods have been proposed that use distinct cover media, using games to hide data remains a recent development. The study presents a steganographic method based on online Tetris games, in which secret messages are embedded using a generated tetrimino sequence. Each time a person plays an online Tetris game, a new tetrimino sequence should be generated. The propo...

متن کامل

Total Tetris : Tetris with Monominoes , Dominoes , Trominoes , Pentominoes , . .

We consider variations on the classic video game Tetris where pieces are k-ominoes instead of the usual tetrominoes (k = 4), as popularized by the video games ntris and Pentris. We prove that it is NP-complete to survive or clear a given initial board with a given sequence of pieces for each k ≥ 5, complementing the previous NP-completeness result for k = 4. More surprisingly, we show that boar...

متن کامل

Crazy Tetris: A Reinforcement Learning Approach to Adversarial Tetris

Our project is to implement an agent that learns to play Tetris in an adversarial environment. The Tetris game was invented by Alexey Pajitnov in 1985. The version we use is a 2-dimensional game that consists of a board with a fixed size and a sequence of bocks of different sizes. Whenever the game provides a new block, the player has a certain amount of time steps to place the block on the boa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009