Polyomino weak achievement games on 3-dimensional rectangular boards

Nandor Sieben, Elaina Deabay

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Polyomino achievement games on 3-dimensional rectangular boards are studied. All except two polyominoes with less than six cells are weak winners. The smallest known paving losers contain six cells. There are finitely many winning polyominoes.

Original languageEnglish (US)
Pages (from-to)61-78
Number of pages18
JournalDiscrete Mathematics
Volume290
Issue number1
DOIs
StatePublished - Jan 28 2005

Fingerprint

Polyomino
Polyominoes
Game
Cell

Keywords

  • Achievement game
  • Animal
  • Hypercube
  • Hypergraph game
  • Polyomino

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Polyomino weak achievement games on 3-dimensional rectangular boards. / Sieben, Nandor; Deabay, Elaina.

In: Discrete Mathematics, Vol. 290, No. 1, 28.01.2005, p. 61-78.

Research output: Contribution to journalArticle

@article{6d4abf8fdc164c14beaf23fb0739927f,
title = "Polyomino weak achievement games on 3-dimensional rectangular boards",
abstract = "Polyomino achievement games on 3-dimensional rectangular boards are studied. All except two polyominoes with less than six cells are weak winners. The smallest known paving losers contain six cells. There are finitely many winning polyominoes.",
keywords = "Achievement game, Animal, Hypercube, Hypergraph game, Polyomino",
author = "Nandor Sieben and Elaina Deabay",
year = "2005",
month = "1",
day = "28",
doi = "10.1016/j.disc.2004.11.001",
language = "English (US)",
volume = "290",
pages = "61--78",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Polyomino weak achievement games on 3-dimensional rectangular boards

AU - Sieben, Nandor

AU - Deabay, Elaina

PY - 2005/1/28

Y1 - 2005/1/28

N2 - Polyomino achievement games on 3-dimensional rectangular boards are studied. All except two polyominoes with less than six cells are weak winners. The smallest known paving losers contain six cells. There are finitely many winning polyominoes.

AB - Polyomino achievement games on 3-dimensional rectangular boards are studied. All except two polyominoes with less than six cells are weak winners. The smallest known paving losers contain six cells. There are finitely many winning polyominoes.

KW - Achievement game

KW - Animal

KW - Hypercube

KW - Hypergraph game

KW - Polyomino

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

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

U2 - 10.1016/j.disc.2004.11.001

DO - 10.1016/j.disc.2004.11.001

M3 - Article

AN - SCOPUS:12344328611

VL - 290

SP - 61

EP - 78

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -