Rectangular polyomino set weak (1, 2)-achievement games

Edgar Fisher, Nandor Sieben

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

In a polyomino set (1, 2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker tries to prevent the maker from achieving his goal. The teams of polyominoes for which the maker has a winning strategy is determined up to size 4. In set achievement games, it is natural to study infinitely large polyominoes. This enables the construction of super winners that characterize all winning teams up to a certain size.

Original languageEnglish (US)
Pages (from-to)333-340
Number of pages8
JournalTheoretical Computer Science
Volume409
Issue number3
DOIs
StatePublished - Dec 28 2008

    Fingerprint

Keywords

  • Achievement games
  • Polyomino

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this