Computing strategies for graphical Nim

MaRDI QIDQ3015599zbMATH OpenFDO

Authors Neil J. Calkin, Janine Elizabeth Janoski, Sarah Leggett, Bryce Richards, Nathan Sitaraman, Stephanie M. Thomas, Kevin James

Publication date 13 July 2011

Mathematics Subject Classification ID

Vertex degrees (05C07) Games on graphs (graph-theoretic aspects) (05C57)

Recommendations

• A Nim game played on graphs. II.
• Notes on the combinatorial game: graph Nim
• Nim on the complete graph.
• scientific article; zbMATH DE number 7199604
• Additive periodicity of the Sprague-Grundy function of certain Nim games

Cited in

(19)

• The generalized Sprague-Grundy function and its invariance under certain mappings
• A Nim game played on graphs. II.
• Infinite cyclic impartial games
• On pruning search trees of impartial games
• Disjunctive sums of quasi-nimbers
• Nim on the complete graph.
• Computer analysis of Sprouts with nimbers
• Searching for periodicity in Officers
• The game of blocking pebbles
• Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees
• scientific article; zbMATH DE number 7021370 (Why is no real title available?)
• A codex of \(\mathcal{N}\)- and \(\mathcal{P}\)-positions in Harary's `caterpillar game'
• Notes on the combinatorial game: graph Nim
• Pyramid Nim
• Topological network-control games
• Topological network-control games
• Topological network-control games played on graphs
• Network control games played on graphs
• A variant of Nim

This page was built for publication: Computing strategies for graphical Nim

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3015599)