Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions
This paper considers a tic-tac-toe game played on the \(d\)-dimensional integer lattice. The game is a Maker-Breaker version of tic-tac-toe, where the first player, Maker, only tries to occupy a winning line and the second player, Breaker, only tries to stop Maker from occupying a winning line. The paper considers the bounded number of game directions, in which it designates a finite set of direction-vectors \(S\) which determines the set of winning lines. It shows, that for the special case when the coordinates of each direction-vector are bounded, Breaker can win this game. In addition, it shows that Maker can build winning lines if \(S\) is the set of all direction-vectors with bounded coordinates.
- A pairing strategy for tic-tac-toe on the integer lattice with numerous directions
- Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions
- scientific article; zbMATH DE number 7021370
- scientific article; zbMATH DE number 1787229
- Some strategies for higher dimensional animal achievement games
This page was built for publication: Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380436)
