Snort Played on Triangular Grids

TL;DR

This paper analyzes a two-player coloring game called Snort played on triangular grid graphs, proving that the first player has a winning strategy on small triangular grids with optimal play.

Contribution

It demonstrates that on triangular grids with one or two rows, the first player can always win when both players play optimally, extending understanding of combinatorial game strategies.

Findings

First player wins on small triangular grids with optimal play.

Winning strategy exists for grids with one or two rows of triangles.

Results extend to various grid variants.

Abstract

Snort is a two-player game played on a simple graph in which the players take turns colouring vertices in their own colour, with the restriction that two adjacent vertices cannot have opposite colours. We will show that on triangular grids with one or two rows of triangles, and many of their variants, the first player will win when playing optimally.