即使使用$O(1)$行或列,俄罗斯方块也是NP难的
Tetris is NP-hard even with $O(1)$ rows or columns
摘要:
我们证明了经典的方块游戏俄罗斯方块(生存和棋盘清除)仍然是NP完全的,即使限制到8列,或4行,解决了15年前提出的开放问题[BDH+04]。我们的减少是从3分区,类似于以前的减少不受限制的董事会大小,但更好地包装桶。在积极的一面,我们证明了2列俄罗斯方块(和1行俄罗斯方块)是多项式。我们还证明了俄罗斯方块的推广到更大的$k$ -omino件是NP完全的,即使当董事会开始空,即使限制到3列或2行或恒定大小的件。最后,我们提出了一个动画俄罗斯方块字体。
英文摘要:
We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open problems posed over 15 years ago [BDH+04]. Our reduction is from 3-Partition, similar to the previous reduction for unrestricted board sizes, but with a better packing of buckets. On the positive side, we prove that 2-column Tetris (and 1-row Tetris) is polynomial. We also prove that the generalization of Tetris to larger $k$-omino pieces is NP-complete even when the board starts empty, even when restricted to 3 columns or 2 rows or constant-size pieces. Finally, we present an animated Tetris font.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。