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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams R, Dixon J, Elder J, Peabody J, Vega O, Willis K (2016) Combinatorial analysis of a subtraction game on graphs. Int J Combin 2016:1476359
Albert M, Nowakowski R, Wolfe D (2007) Lessons in play: an introduction to combinatorial game theory. CRC Press, Boca Raton
Berkelamp ER, Conway JH, Guy RK (2001–2004) Winning ways for your mathematical plays, vols. 1–4, 2nd edn. A K Peters, Wellesley
Bodlaender HL, Kratsch D (2002) Kayles and nimbers. J Algorithms 43(1):106–119
Fleischer R, Trippen G (2006) Kayles on the way to the stars. In: Jaap van den Herik H et al (eds) Fourth international conference computers and games. LNCS Book Series, vol 3846. Springer, Berlin. https://doi.org/10.1007/11674399_16
Guy RK, Smith CA (1956) The G-values of various games. In: Mathematical proceedings of the Cambridge Philosophical Society, vol 52, no. 03. Cambridge University Press, Cambridge, pp 514–526
Huggan M (2015) Impartial intersection restriction games, Master’s thesis. Retrieved from Carleton University Research Virtual Environment (CURVE) (Record b3819898)
Lampis M, Mitsou V (2014) The computational complexity of the game of set and its theoretical applications. Latin American symposium on theoretical informatics. Springer, Berlin, pp 24–34
Noon H, Van Brummelen G (2006) The non-attacking queens game. Coll Math J 37(3):223–227
O’Sullivan C (2017) A vertex and edge deletion game on graphs. arXiv:1709.01354
Schaeffer TJ (1978) On the complexity of some two-person perfect-information games. J Comput Syst Sci 16(2):185–225. https://doi.org/10.1016/0022-0000(78)90045-4
Siegel AN (2013) Combinatorial game theory, vol 146. American Mathematical Society, Providence
Sprague R (1935) Über mathematische Kampfspiele. Tohoku Math J First Ser 41:438–444
Stevens B, Huggan M (2016) Polynomial time graph families for Arc-Kayles. INTEGERS 16:2
Acknowledgements
This work has been supported by the ANR-14-CE25-0006 project of the French National Research Agency. The authors would like to thank Nicolas Bousquet for his help.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dailly, A., Gledel, V. & Heinrich, M. A generalization of Arc-Kayles. Int J Game Theory 48, 491–511 (2019). https://doi.org/10.1007/s00182-018-0639-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00182-018-0639-5