Tic-Tac-Toe on an affine plane of order 4
From MaRDI portal
Publication:5080903
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1944397 (Why is no real title available?)
- scientific article; zbMATH DE number 7021370 (Why is no real title available?)
- Combinatorial Games
- Enumeration of MOLS of small order
- On a combinatorial game
- Positional Games
- The CRC handbook of combinatorial designs
- Tic-tac-toe on a finite plane
Cited in
(4)
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)