Sprague-Grundy function of symmetric hypergraphs
From MaRDI portal
Publication:2424909
Abstract: We consider a generalization of the classical game of called hypergraph . Given a hypergraph on the ground set of piles of stones, two players alternate in choosing a hyperedge and strictly decreasing all piles . The player who makes the last move is the winner. Recently it was shown that for many classes of hypergraphs the Sprague-Grundy function of the corresponding game is given by the formula introduced originally by Jenkyns and Mayberry (1980). In this paper we characterize symmetric hypergraphs for which the Sprague-Grundy function is described by the same formula.
Recommendations
Cites work
- scientific article; zbMATH DE number 5145315 (Why is no real title available?)
- scientific article; zbMATH DE number 2115805 (Why is no real title available?)
- scientific article; zbMATH DE number 3027208 (Why is no real title available?)
- On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
- The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\)
Cited in
(8)- Computational Hardness of Multidimensional Subtraction Games
- On the Sprague-Grundy function of compound games
- On the Sprague-Grundy function of extensions of proper \textsc{nim}
- Sprague-Grundy function of matroids and related hypergraphs
- Slow \(K\)-\textsc{Nim}
- Bachet's game with lottery moves
- Impartial hypergraph games
- On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
This page was built for publication: Sprague-Grundy function of symmetric hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2424909)