ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing Letters
Volume 89, Issue 6, 31 March 2004, Pages 267-272
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (247 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ipl.2003.12.006    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier B.V. All rights reserved.

Tetris and decidability

Hendrik Jan HoogeboomCorresponding Author Contact Information, E-mail The Corresponding Author and Walter A. KostersE-mail The Corresponding Author

Leiden Institute of Advanced Computer Science (LIACS), Universiteit, Leiden, The Netherlands

Received 3 September 2003; 
revised 20 December 2003. 
Communicated by L. Boasson 
Available online 3 February 2004.

Purchase the full-text article



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 Image 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


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.