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

Edgar Fisher, Nandor Sieben

Research output: Contribution to journalArticle

3 Citations (Scopus)

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

Polyomino
Polyominoes
Game
Cell
Congruent

Keywords

  • Achievement games
  • Polyomino

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Rectangular polyomino set weak (1, 2)-achievement games. / Fisher, Edgar; Sieben, Nandor.

In: Theoretical Computer Science, Vol. 409, No. 3, 28.12.2008, p. 333-340.

Research output: Contribution to journalArticle

@article{c24c252fe7bb45bebba7e2c69d6aa597,
title = "Rectangular polyomino set weak (1, 2)-achievement games",
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.",
keywords = "Achievement games, Polyomino",
author = "Edgar Fisher and Nandor Sieben",
year = "2008",
month = "12",
day = "28",
doi = "10.1016/j.tcs.2008.05.024",
language = "English (US)",
volume = "409",
pages = "333--340",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

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

AU - Fisher, Edgar

AU - Sieben, Nandor

PY - 2008/12/28

Y1 - 2008/12/28

N2 - 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.

AB - 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.

KW - Achievement games

KW - Polyomino

UR - http://www.scopus.com/inward/record.url?scp=55949088180&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=55949088180&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2008.05.024

DO - 10.1016/j.tcs.2008.05.024

M3 - Article

AN - SCOPUS:55949088180

VL - 409

SP - 333

EP - 340

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 3

ER -