I think this got published in 1990, but I can find little evidence even if the journal's existence online.
I think this got published in 1990, but I can find little evidence even if the journal's existence online.
https://www.researchgate.net/publication/2347389_How_to_Lose...
The proof itself is quite self-evident: given a perfectly randomly block generator, and infinite play time, eventually you're going to produce a very long sequence of left- (or right-) facing S-blocks. Since those are impossible to eliminate (there's always one block left open on a row) eventually you lose.
https://tetris.wiki/Tetris_Guideline
https://tetris.wiki/Random_Generator
Thus, in a game of Tetris adhering to these official guidelines, the longest sequential run of S and Z pieces would be 4, in the following sequence:
[5 Random Blocks] [Z and S in any order] [Z and S in any order] [5 Random Blocks]
I'd be very curious to see a proof of an impossible sequence which adheres to the official rules, as that would be quite a feat indeed!
It sounds like, given enough piece previews, you can play without ever losing: http://tetris.wikia.com/wiki/Playing_forever
Any dab hands at regex out there? I think this is the regex to match, but something feels wrong about it
(([^sz]){5}[sz]{2})([sz]{2}([^sz]){5})As observed elsewhere, neither work according to official Tetris rules.
This seems like the sort of theorem that a college student might be inclined to prove.