Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01188912
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 31, 2015 - 5:03:47 PM
Last modification on : Thursday, September 7, 2017 - 1:03:41 AM
Long-term archiving on: : Tuesday, December 1, 2015 - 10:44:27 AM

File

dmtcs-16-3-8.pdf
Publisher files allowed on an open archive

Identifiers

  • 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⟩

Share

Metrics

Record views

84

Files downloads

815