Chalkdust math article by Bristow works out which Tetris piece sequences can force any player to lose, regardless of skill.
Key Takeaways
Frames Tetris as an adversarial game theory problem: can a piece-chooser always guarantee the player’s board overflows?
Bristow identifies specific pieces that, when chosen strategically by an adversary, make losing unavoidable.
Published in Chalkdust, a recreational mathematics magazine, so expect formal combinatorial reasoning over heuristic play.
The core question is not “how to play well” but “which piece orderings are unbeatable” – a ceiling-proof result.
Hacker News Comment Review
The single comment skips discussion and goes straight to HATETRIS, a live browser implementation of adversarial Tetris that always serves the worst possible piece.
Notable Comments
@crtasm: points to HATETRIS – a playable proof-of-concept for the adversarial piece strategy described in the article.
