Tetris is NP-hard even with $O(1)$ rows or columns — mentioned by dang

Mon, 01 Sep 2025 16:46:27 GMT

Good catch! Based on https://arxiv.org/abs/2009.14336, I put 2020 in the title above.

Paper and discussion history. A mention is not an endorsement.

Tetris is NP-hard even with $O(1)$ rows or columns — mentioned by alephnan

Wed, 20 Apr 2022 04:36:18 GMT

> Mathematically, we can formulate this a sequential zero-sum game with perfect information. Is this not just restating that Tetris is NP-hard? https://arxiv.org/abs/2009.14336

Paper and discussion history. A mention is not an endorsement.

Tetris is NP-hard even with $O(1)$ rows or columns · HackerPapers discussions

Tetris is NP-hard even with $O(1)$ rows or columns — mentioned by dang

Tetris is NP-hard even with $O(1)$ rows or columns — mentioned by alephnan