![]() We present a new class of packing problems called the Tetris-Packing Problem (TPP). Their version allowed for game boards of arbitrary initial configuration, width, and height. ![]() recently formalized the game into the Tetris Problem, which they proved NP-hard. Scoring is based on the number of rows eliminated. The game ends when the height of the block stack prevents placing new pieces. Completed rows of unit grid squares are eliminated from the stack and a new empty row is created on top. As each piece falls, players must slide them left or right or rotate them, in order to form complete rows of unit blocks. The game pieces consist of an endless random sequence of tetrominoes, or shapes made up of four unit squares arranged in various ways. A player starts out with an empty vertical game board divided into unit squares. Tetris is a classic video game invented by Alexey Pazhitnov, a Russian mathematician, in the 1980’s.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |