3 ms·
Is there a minimal guaranteed optimal play for the game of tetris (not just hatetris as linked here). Or phrased another way, if you play against the smartest,
by mitko 5y ago
Is there a minimal guaranteed optimal play for the game of tetris (not just hatetris as linked here). Or phrased another way, if you play against the smartest, most devious AI, what's a score that you cannot get past.
The high score of hatetris seems to be 31 lines, but it seems that it may be taking advantage of the algorithm being myopically giving you the worst piece 1 step ahead, and being deterministic. I wonder if the algorithm has some randomness (among multiple horrible pieces) and multi-step look ahead, how would that affect the high score.
Has anyone done research on tetris's worst case bounds?
- xgulfie 5y agoTetris' worst case is all S-pieces or all Z-pieces, in which case you could never clear a single line.
- lalaithion 5y agoYou can trivially clear lines with infinite S-pieces or infinite Z-pieces.
- lalaithion 5y agoThe author of Hatetris did a quick look into this: https://qntm.org/tetris https://qntm.org/tetris