On the Sprague-Grundy function of \textsc{Exact} k-\textsc{Nim}
From MaRDI portal
Publication:1706111
Abstract: Moore's generalization of the game of {sc Nim} is played as follows. Let and be two integers such that . Given piles of tokens, two players move alternately, removing tokens from at least one and at most of the piles. The player who makes the last move wins. The game was solved by Moore in 1910 and an explicit formula for its Sprague-Grundy function was given by Jenkyns and Mayberry in 1980, for the case only. We introduce another generalization of {sc Nim}, called {sc Exact -Nim}, in which each move reduces exactly piles. We give an explicit formula for the Sprague-Grundy function of {sc Exact -Nim} in case . In case our formula is surprisingly similar to Jenkyns and Mayberry's one.
Recommendations
Cites work
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 3027208 (Why is no real title available?)
- The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\)
- Winning ways for your mathematical plays. Vol. 1.
Cited in
(11)- On tame, pet, domestic, and miserable impartial games
- On the Sprague-Grundy function of extensions of proper \textsc{nim}
- Bachet's game with lottery moves
- Sprague-Grundy function of matroids and related hypergraphs
- Sprague-Grundy function of symmetric hypergraphs
- More about Exact Slow $k$-Nim
- Computational Hardness of Multidimensional Subtraction Games
- Slow \(K\)-\textsc{Nim}
- On the Sprague-Grundy function of compound games
- Computing remoteness functions of Moore, Wythoff, and Euclid's games
- Impartial games with decreasing Sprague-Grundy function and their hypergraph compound
This page was built for publication: On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706111)