Tetris is Hard, Even to Approximate
From MaRDI portal
Publication:3082942
DOI10.1007/3-540-45071-8_36zbMath1276.68081OpenAlexW2115330428MaRDI QIDQ3082942
David Liben-Nowell, Susan Hohenberger, Erik D. Demaine
Publication date: 18 March 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45071-8_36
Related Items (13)
Tetravex is NP-complete ⋮ The Computational Complexity of Portal and Other 3D Video Games ⋮ The complexity of comparing optimal solutions ⋮ How fast can we play Tetris greedily with rectangular pieces? ⋮ On a generalization of ``eight blocks to madness puzzle ⋮ Graph kernels and Gaussian processes for relational reinforcement learning ⋮ Hanabi is NP-hard, even for cheaters who look at their cards ⋮ The complexity of flood filling games ⋮ Wooden geometric puzzles: Design and hardness proofs ⋮ The computational complexity of Angry Birds ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Tetris and decidability ⋮ LaserTank is NP-Complete
This page was built for publication: Tetris is Hard, Even to Approximate