OFFSET
3,1
COMMENTS
The two-player impartial {0,1}-Toggle game is played on a simple connected graph G where each vertex is assigned an initial weight of 0 or 1.
A Toggle move consists of selecting a vertex v and switching its weight as well as the weights of each of its neighbors. This move is only legal provided the weight of vertex v is 1 and the total sum of the vertex weights decreases.
In the special case G=GP(n,2), a (1,0)-weight assignment is one in which each vertex of the outer polygon is assigned weight 1 and each vertex of the inner polygon(s) is assigned weight 0.
REFERENCES
E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways for Your Mathematical Plays, Vol. 1, CRC Press, 2001.
LINKS
Eugene Fiorini, Maxwell Fogler, Katherine Levandosky, Bryan Lu, Jacob Porter, and Andrew Woldar, On the Nature and Complexity of an Impartial Two-Player Variant of the Game Lights-Out, arXiv:2411.08247 [math.CO], 2024. See p. 17.
E. Fiorini, M. Lind, A. Woldar, and T. W. H. Wong, Characterizing Winning Positions in the Impartial Two-Player Pebbling Game on Complete Graphs, Journal of Integer Sequences, 24(6), 2021.
Katherine Levandosky, CGSuite Program.
EXAMPLE
For n = 3, the {0,1}-Toggle game on GP(3,2) with a (1,0)-weight assignment is a next-player winning game.
For n = 5, the {0,1}-Toggle game on GP(5,2) with a (1,0)-weight assignment is a next-player winning game.
PROG
(CGSuite) # See Levandosky link
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Eugene Fiorini, Maxwell Fogler, Katherine Levandosky, Bryan Lu, Jacob K. Porter and Andrew Woldar, Mar 14 2023
STATUS
approved