Article thumbnail

Notes on the combinatorial game: graph Nim

By Richard M. Low and W.H. Chan

Abstract

The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama. In this paper, we focus on the version of Nim played on graphs which was introduced by N.J. Calkin et al.: Two players alternate turns, each time choosing a vertex $v$ of a finite graph and removing any number $(\geq 1)$ of edges incident to $v$. The player who cannot make a move loses the game. Here, we analyze Graph Nim for various classes of graphs and also compute some Grundy-values

Topics: Nim on graphs, combinatorial game, Mathematics, QA1-939
Publisher: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
Year: 2016
DOI identifier: 10.5614/ejgta.2016.4.2.7
OAI identifier: oai:doaj.org/article:bc276cbf1a54467490359d725d83ac0c
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/2338-2287 (external link)
  • http://ejgta.org/index.php/ejg... (external link)
  • https://doaj.org/article/bc276... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.