Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions

zbMATH Open1202.91044arXiv1005.5469MaRDI QIDQ612906FDOQ612906

Authors: Padmini Mukkamala, Dömötör Pálvölgyi 

Publication date: 16 December 2010

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

Abstract: We show that there is an $m=2n+o(n)$, such that, in the Maker-Breaker game played on $$ where Maker needs to put at least $m$ of his marks consecutively in one of $n$ given winning directions, Breaker can force a draw using a pairing strategy. This improves the result of Kruczek and Sundberg who showed that such a pairing strategy exits if $mge3n$. A simple argument shows that $m$ has to be at least $2n+1$ if Breaker is only allowed to use a pairing strategy, thus the main term of our bound is optimal.

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

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

Recommendations

• A pairing strategy for tic-tac-toe on the integer lattice with numerous directions
• Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions
• The pairing strategies of the 9-in-a-row game
• The Structure of Pairing Strategies for k-in-a-row Type Games
• A characterization on \(n\)-critical economical generalized tic-tac-toe games

Mathematics Subject Classification ID

Combinatorial games (91A46)

Cited In (6)

• Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
• The Structure of Pairing Strategies for k-in-a-row Type Games
• The pairing strategies of the 9-in-a-row game
• A pairing strategy for tic-tac-toe on the integer lattice with numerous directions
• Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions
• Generalized pairing strategies -- a bridge from pairing strategies to colorings

This page was built for publication: Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions

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