An n-in-a-row type game

From MaRDI portal
Publication:311490

zbMATH Open1344.05095arXiv1501.01467MaRDI QIDQ311490FDOQ311490


Authors: Joshua Erde, Mark Walters Edit this on Wikidata


Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We consider a Maker-Breaker type game on the plane, in which each player takes t points on their textrmth 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 nextrmth turn. We actually prove a stronger result: that Breaker only needs to play omega(logt) points on his textrmth 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 talpha points on his textrmth turn.


Full work available at URL: https://arxiv.org/abs/1501.01467

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (4)





This page was built for publication: An \(n\)-in-a-row type game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q311490)