Biased weak polyform achievement games

Abstract : In a biased weak (a,b) polyform achievement game, the maker and the breaker alternately mark a,b previously unmarked cells on an infinite board, respectively. The maker's goal is to mark a set of cells congruent to a polyform. The breaker tries to prevent the maker from achieving this goal. A winning maker strategy for the (a,b) game can be built from winning strategies for games involving fewer marks for the maker and the breaker. A new type of breaker strategy called the priority strategy is introduced. The winners are determined for all (a,b) pairs for polyiamonds and polyominoes up to size four.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 3 (in progress) (3), pp.147--172
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01188912
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 31 août 2015 - 17:03:47
Dernière modification le : jeudi 7 septembre 2017 - 01:03:41
Document(s) archivé(s) le : mardi 1 décembre 2015 - 10:44:27

Fichier

dmtcs-16-3-8.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01188912, version 1

Collections

Citation

Ian Norris, Nándor Sieben. Biased weak polyform achievement games. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 3 (in progress) (3), pp.147--172. 〈hal-01188912〉

Partager

Métriques

Consultations de la notice

30

Téléchargements de fichiers

96