Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9512212 | Discrete Mathematics | 2005 | 18 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
NĂ¡ndor Sieben, Elaina Deabay,