Tetris is Hard, Even to Approximate

نویسندگان

  • Erik D. Demaine
  • Susan Hohenberger
  • David Liben-Nowell
چکیده

Figure 1: The tetrominoes Sq (“square”), LG (“left gun”), RG (“right gun”), LS (“left snake”), RS (“right snake”), I, and T, with each piece’s center marked. of the top row of the gameboard, and falls downward at a constant speed. As it falls, the player can rotate the piece and slide it horizontally. If, when the piece comes to rest, all gridsquares in an entire row h of the gameboard are filled, row h is cleared : all rows above h fall one row lower, and the top row of the gameboard is replaced by an entirely unfilled row. As soon as a piece is fixed in place, the next piece appears at the top of the gameboard. Typically a one-piece lookahead is provided: when the ith piece begins falling, the identity of the (i + 1)st piece is revealed. A player loses when a new piece is blocked by filled gridsquares from entirely entering the gameboard. The player’s objective is to maximize his or her score (which increases as pieces are placed and as rows are cleared).

برای دانلود متن کامل این مقاله و بیش از 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 ...

متن کامل

Elimination of Hard-Nonlinearities Destructive Effects in Control Systems Using Approximate Techniques

Many of the physical phenomena, like friction, backlash, drag, and etc., which appear in mechanical systems are inherently nonlinear and have destructive effects on the control systems behavior. Generally, they are modeled by hard nonlinearities. In this paper, two different methods are proposed to cope with the effects of hard nonlinearities which exist in friction various models. Simple inver...

متن کامل

Complexity of a Tetris variant

The game complexity of Tetris was first studied by Erik demaine, Susan Hohenberger and David LibenNowell in “Tetris is hard" [1]. Their proof was later simplified in “Tetris is hard, made easy” [2]. The authors of the last two papers published a joint paper [3], In “Tetris is hard” they left open the question of the complexity of a variant of the game. In this variant, we can move and rotate a ...

متن کامل

Approximate modified policy iteration and its application to the game of Tetris

Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three implementations of approximate MPI (AMPI) that are exten...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Int. J. Comput. Geometry Appl.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2003