Domino-tiling games

Research output: Contribution to journalArticle

58 Scopus citations

Abstract

Games in which players build domino tilings are considered. The computational complexity of problems of existence of winning strategies is investigated. These problems are shown to be complete in the respective complexity classes, e.g., SQUARE TILING GAME is complete in PSPACE, HIGH TILING GAME is complete in 2EXPTIME and has a doubly exponential time lower bound. As an application, new simple hardness proofs for certain propositional logics are obtained.

Original languageEnglish (US)
Pages (from-to)374-392
Number of pages19
JournalJournal of Computer and System Sciences
Volume32
Issue number3
DOIs
StatePublished - Jun 1986
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Domino-tiling games'. Together they form a unique fingerprint.

  • Cite this