Tetris and decidability

We consider a variant of Tetris where the sequence of pieces (together with their orientation and horizontal position, which cannot be changed anymore) is generated by a finite state automaton. We show that it is undecidable, given such an automaton, and starting from an empty game board, whether one of the generated sequences leaves an empty game board. This is contrasted with more common situations where piece translations and rotations are allowed.