A generalization of Arc-Kayles

Antoine Dailly 1 Valentin Gledel 1 Marc Heinrich 1
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : The game Arc-Kayles is played on an undirected graph with two players taking turns deleting an edge and its endpoints from the graph. We study a generalization of this game, Weighted Arc Kayles (WAK for short), played on graphs with counters on the vertices. The two players alternate choosing an edge and removing one counter on both endpoints. An edge can no longer be selected if any of its endpoints has no counter left. The last player to play a move wins. We give a winning strategy for WAK on trees of depth 2. Moreover, we show that the Grundy values of WAK and Arc-Kayles are unbounded. We also prove a periodicity result on the outcome of WAK when the number of counters is fixed for all the vertices but one. Finally, we show links between this game and a variation of the non-attacking queens game on a chessboard.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01587921
Contributor : Antoine Dailly <>
Submitted on : Thursday, October 4, 2018 - 12:02:25 PM
Last modification on : Thursday, January 3, 2019 - 1:47:27 PM
Long-term archiving on : Saturday, January 5, 2019 - 12:28:54 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

Citation

Antoine Dailly, Valentin Gledel, Marc Heinrich. A generalization of Arc-Kayles. International Journal of Game Theory, Springer Verlag, In press, pp.1-21. ⟨10.1007/s00182-018-0639-5⟩. ⟨hal-01587921v3⟩

Share

Metrics

Record views

88

Files downloads

63