An \(n\)-in-a-row type game (Q311490)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An \(n\)-in-a-row type game |
scientific article |
Statements
An \(n\)-in-a-row type game (English)
0 references
13 September 2016
0 references
Summary: We consider a Maker-Breaker type game on the square grid, in which each player takes \(t\) points on their \(t^{\text{th}}\) turn. Maker wins if he obtains \(n\) points on a line (in any direction) without any of Breaker's points between them. We show that, despite Maker's apparent advantage, Breaker can prevent Maker from winning until about his \(n^{\text{th}}\) turn. We actually prove a stronger result: Breaker only needs to claim \(\omega(\log t)\) points on his \(t^{\text{th}}\) turn to prevent Maker from winning until this time. We also consider the situation when the number of points claimed by Maker grows at other speeds, in particular, when Maker claims \(t^\alpha\) points on his \(t^{\text{th}}\) turn.
0 references
Maker-Breaker
0 references
\(n\)-in-a-row game
0 references