par Cardinal, Jean 
;Collette, Sébastien ;Ito, Hiro;Korman, Matias ;Langerman, Stefan ;Sakaidani, Hikaru;Taslakian, Perouz
Référence European Workshop on Computational Geometry(XXVII: 28-30 March, 2011: Morschach, Switzerland), Abstracts from EuroCG 2011, page (131-134)
Publication Publié, 2011
;Collette, Sébastien ;Ito, Hiro;Korman, Matias ;Langerman, Stefan ;Sakaidani, Hikaru;Taslakian, Perouz Référence European Workshop on Computational Geometry(XXVII: 28-30 March, 2011: Morschach, Switzerland), Abstracts from EuroCG 2011, page (131-134)
Publication Publié, 2011
Abstract de conférence
| Résumé : | This paper presents a new partial two-player game, called the cannibal animal game, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first player Alice, who can occupy a cell in each turn, wins if she occupies a set of cells, the union of a subset of which is a translated or rotated copy of a previously agreed upon polyomino P (called an animal). The objective of the second player Bob is to prevent Alice from creating her animal by occupying in each round a translated or rotated copy of P. An animal is a cannibal if Bob has a winning strategy, and a non-cannibal otherwise. This paper presents some new tools, such as the bounding strategy and thepunching lemma, to classify animals into cannibals or non-cannibals. It is also shown that the pairing strategy also works for this problem. |
