Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Based on the question The Mathematics of Tetris, I was wondering if it is possible to have a series of tetris blocks that is impossible to clear. For example, getting the string TTTSS.. forces the player to lose even with best play.

Assuming that the tetris field is as usual, 20 high by 10 wide.

share|improve this question
    
You should probably have a look at Bastet –  Vincent Nivoliers Oct 16 '12 at 17:13
    
When you say that the question is MoT 2.0, does that mean that with every substantial edit you will increase the version? Will there be alpha/beta/release candidate versions as well? :-) –  Asaf Karagila Oct 16 '12 at 19:47
    
@Asaf, that isn't for me to decide. I am sure others will have other questions that are similar in nature. –  picakhu Oct 16 '12 at 21:36
add comment

1 Answer

up vote 2 down vote accepted

Yes.

In the paper How to lose at tetris, Heidi Burgiel shows that "the tetris game consisting of only $Z$-tetrominoes alternating orientation will always end before 70,000 tetrominoes have been played." The paper also shows that a game with random play by the computer will end with probability one, because almost surely a sequence of 127,200 consecutive alternating $Z$-tetrominoes will eventually appear, and this forces the game to end from any position.

John Brzustowski had previously proved that the computer has a winning strategy.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.