The Sprague-Grundy function for some selective compound games
classification
🧮 math.CO
keywords
sprague-grundycompoundfunctionsgamesselectivealmostanalyzebehave
read the original abstract
We analyze the Sprague-Grundy functions for a class of almost disjoint selective compound games played on Nim heaps. Surprisingly, we find that these functions behave chaotically for smaller Sprague-Grundy values of each component game yet predictably when any one heap is sufficiently large.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.