arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0210020cs.CCcs.CGcs.DM
收藏

俄罗斯方块很难,甚至很难近似

Tetris is Hard, Even to Approximate

Erik D. Demaine, Susan Hohenberger, David Liben-Nowell

摘要:

在流行的计算机游戏俄罗斯方块中,玩家被给予一系列的俄罗斯方块,并且必须将它们打包到一个矩形游戏板中,该游戏板最初由给定的填充方块组成;游戏板中任何完全填充的行都被清除,并且所有在其上方的棋子都下降一行。我们证明,在离线版本的俄罗斯方块,它是NP-完全的,以最大限度地提高清除的行数,最大限度地提高俄罗斯方块的数量(四倍行同时填充和清除),最大限度地减少被占领的广场的最大高度,或最大限度地提高游戏结束前放置的棋子的数量。我们还证明了,当给定一个p段序列时,第一个和最后一个目标在因子p^(1-n)内的极端不可近似性,以及对于任何n>0,第三个目标在因子(2 -n)内的不可近似性。我们的研究结果在俄罗斯方块规则的几种变化下保持不变,包括不同的旋转模型,对玩家敏捷性的限制,以及受限制的棋子集。

英文摘要:

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 rows, maximize the number of tetrises (quadruples of rows simultaneously filled and cleared), minimize the maximum height of an occupied square, or maximize the number of pieces placed before the game ends. We furthermore show the extreme inapproximability of the first and last of these objectives to within a factor of p^(1-epsilon), when given a sequence of p pieces, and the inapproximability of the third objective to within a factor of (2 - epsilon), for any epsilon>0. Our results hold under several variations on the rules of Tetris, including different models of rotation, limitations on player agility, and restricted piece sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑