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

From MaRDI portal
(Redirected from Publication:612906)




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.









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)