Asymptotically Optimal Pairing Strategy for Tic-Tac-Toe with Numerous Directions

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

doi:10.37236/482

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2011

2018

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(Of course for k ≤ 4 Maker wins easily.) On the other hand, it was shown that there are no pairing strategies for k ≤ 8, see [5,10].…”

Section: Introductionmentioning

confidence: 99%

The pairing strategies of the 9-in-a-row game

2018

View full text Add to dashboard Cite

One of the most useful strategies for proving Breaker's win in Maker-Breaker Positional Games is to find a pairing strategy. In some cases there are no pairing strategies at all, in some cases there are unique or almost unique strategies. For the kin a row game, the case k = 9 is the smallest (sharp) for which there exists a Breaker winning pairing (paving) strategy. One pairing strategy for this game was given by Hales and Jewett. In this paper we show that there are other winning pairings for the 9-in-a-row game, all have a very symmetric torus structure. While describing these symmetries we prove that there are only a finite number of non-isomorphic pairings for the game (around 200 thousand), which can be also listed up by a computer program. In addition, we prove that there are no "irregular", non-symmetric pairings. At the end of the paper we also show a pairing strategy for a variant of the 3-dimensional kin a row game.

show abstract

“…(Of course for k ≤ 4 Maker wins easily.) On the other hand, it was shown that there are no pairing strategies for k ≤ 8, see [5,10].…”

Section: Introductionmentioning

confidence: 99%