Tic-Tac-Toe on an Affine Plane of order 4

zbMATH Open1492.91065arXiv2009.11363MaRDI QIDQ5080903FDOQ5080903

Rehan Malik, Peter Danziger, Melissa Huggan, Trent Gregory Marbach

Publication date: 31 May 2022

Abstract: The game of tic-tac-toe is well known. In particular, in its classic version it is famous for being unwinnable by either player. While classically it is played on a grid, it is natural to consider the effect of playing the game on richer structures, such as finite planes. Playing the game of tic-tac-toe on finite affine and projective planes has been studied previously. While the second player can usually force a draw, for small orders it is possible for the first player to win. In this regard, a computer proof that tic-tac-toe played on the affine plane of order 4 is a first player win has been claimed. In this note we use techniques from the theory of latin squares and transversal designs to give a human verifiable, explicit proof of this fact.

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

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial games (91A46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial Games
• On a combinatorial game
• Enumeration of MOLS of small order
• Positional Games
• Tic-Tac-Toe on a Finite Plane

Cited In (1)

• A pairing strategy for tic-tac-toe on the integer lattice with numerous directions

This page was built for publication: Tic-Tac-Toe on an Affine Plane of order 4

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