Here's a puzzle I've been thinking about for a while, but still don't have an answer to.
Lets say a friend is playing Tetris, but instead of the computer picking pieces at random you get to choose which pieces are added. (Unlike the computer you do not have to pick from a bag, you may choose any piece any time) Now since you are a good friend you obviously want to use this power to cause your friend to lose. And there are cases where you can force a loss on your opponent. However the my question is can you choose a static order of pieces that will force your opponent to lose no matter what moves they make?
For example if the board were only 3 squares tall you could force your opponent to lose by only choosing one variety of
Z pieces and feeding your friend only that piece. However traditionally Tetris is played on a 10x20 board in which this strategy does not work.
So can you find a sequence of pieces that forces a loss? I would prefer to see shorter than longer solutions.
You may choose to ignore or allow complex moves like
T spins. And I would love to see solutions that do both.