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 language | English (US) |
---|---|
Pages (from-to) | 61-78 |
Number of pages | 18 |
Journal | Discrete Mathematics |
Volume | 290 |
Issue number | 1 |
DOIs | |
State | Published - Jan 28 2005 |
Keywords
- Achievement game
- Animal
- Hypercube
- Hypergraph game
- Polyomino
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics