Copyright © 2003 Elsevier B.V. All rights reserved.
Tetris and decidability
Received 3 September 2003;
revised 20 December 2003.
Communicated by L. Boasson
Available online 3 February 2004.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We consider a variant of
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.
Author Keywords: Tetris; Decidability; Theory of computation







E-mail Article
Add to my Quick Links

Cited By in Scopus (2)






