Ian Norris ; Nándor Sieben - Biased weak polyform achievement games

dmtcs:2098 - Discrete Mathematics & Theoretical Computer Science, August 1, 2014, Vol. 16 no. 3 - https://doi.org/10.46298/dmtcs.2098
Biased weak polyform achievement gamesArticle

Authors: Ian Norris 1; Nándor Sieben 1

  • 1 Department of Mathematics and Statistics [Flagstaff]

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.

Volume: Vol. 16 no. 3
Section: Combinatorics
Published on: August 1, 2014
Submitted on: July 21, 2011
Keywords: biased achievement games,priority strategy,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 344 times.
This article's PDF has been downloaded 354 times.