Tetris is Hard, Even to Approximate · HackerPapers discussions

Tetris is Hard, Even to Approximate — mentioned by bjourne

Wed, 04 Sep 2019 15:38:00 GMT

Yeah, it is interesting to ponder how much the game changes by a seemingly simple detail like how the pieces are generated. If they are generated uniformly then it is certain that the player will lose sooner or later (getting too many S or Z pieces in a row). It also has been shown that such a setup makes the game NP complete. https://arxiv.org/abs/cs/0210020 It's way above my head but intuitively it feels like any randomization based on the bag model would give rise to optimal strategies, even making it possible to play indefinitely. PVP play as you say of course makes it much more…

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

Tetris is Hard, Even to Approximate — HN submission

Fri, 29 Mar 2019 10:45:58 GMT

Tetris Is Hard, Even to Approximate

126 points; 39 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Tetris is Hard, Even to Approximate — mentioned by croikle

Fri, 24 May 2013 15:52:07 GMT

Note that results like this [0] tend to be for generalizations. '''It is natural to generalize the Tetris gameboard to m-by-n, since a relatively simple dynamic program solves the case of a constant-size gameboard in time polynomial in the number of pieces.''' [0] http://arxiv.org/abs/cs/0210020

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

Tetris is Hard, Even to Approximate — mentioned by Xk

Thu, 21 Jul 2011 01:37:18 GMT

For those that care, a few years ago some researchers proved Tetris is NP-complete for many problems. http://arxiv.org/abs/cs.CC/0210020

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

Tetris is Hard, Even to Approximate — mentioned by dangrover

Sun, 07 Dec 2008 09:23:17 GMT

Could prove tricky. After all, Tetris is NP-complete: http://arxiv.org/abs/cs.CC/0210020 (kind of an interesting proof -- they reduce it to the problem of partitioning multisets of numbers into groups of equal sums)

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

Tetris is Hard, Even to Approximate — mentioned by aston

Tue, 08 Jul 2008 18:57:49 GMT

Tetris is Hard, even to approximate. http://arxiv.org/abs/cs.CC/0210020

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

Tetris is Hard, Even to Approximate — HN submission

Fri, 16 Nov 2007 03:17:01 GMT

Tetris is Hard, Even to Approximate

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.