Variations on Narrow Dots-and-Boxes and Dots-and-Triangles
Adam Jobson, Levi Sledd, Susan C. White, D. Jacob Wildstrom

TL;DR
This paper proves specific strategic outcomes in narrow Dots-and-Boxes and Dots-and-Triangles games, confirming a conjecture and analyzing first-player guarantees in various game configurations.
Contribution
It verifies a conjecture about first-player wins in closed 1×n Dots-and-Triangles and analyzes tie guarantees in open and closed 1×n Dots-and-Boxes for even n.
Findings
Closed 1×n Dots-and-Triangles is a first-player win when n ≠ 2
First player can guarantee a tie in open and closed 1×n Dots-and-Boxes for even n
Confirmed conjecture of Nowakowski and Ottaway
Abstract
We verify a conjecture of Nowakowski and Ottaway that closed Dots-and-Triangles is a first-player win when . We also prove that in both the open and closed Dots-and-Boxes games where is even, the first player can guarantee a tie.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Cellular Automata and Applications · semigroups and automata theory
