Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Help needed in understanding S-Grundy Number , any good tutorial.

I am trying to solve Mathalon Problem 146 S-Grundy Game (dead link).

share|cite|improve this question
Look up "Sprague-Grundy" on google. What worked for me was attending a course with Aviezri Fraenkel, but your mileage may differ. – Yuval Filmus Jun 5 '11 at 0:19
The page is long gone, but you can see there were some problems there at… and the first of which was referenced in – Mark S. Apr 17 at 20:04

I've included this in some other answers of mine, but figured it might be able to stand on its own as a community-wiki resource list.

Some resources describing the strategy for Nim and the Sprague-Grundy Theorem and how they can be applied to other impartial games can be found at one or more of the following:

If you learn about Nim and the Sprague-Grundy theorem and how they work together, then the next thing to learn is about octal games. Because of the strategy for Nim (how Grundy values combine), it suffices to know the Grundy/Nim values for a single "heap". If you calculate enough of these for many octal games, you often see a pattern. The sequence appears to be eventually periodic. There is a theorem attributed to Guy and Smith that says an apparent periodicity that goes on for long enough is guaranteed to continue forever. You can read about it on page 11 of Misère Games and Misère Quotients by Aaron N. Siegel, in this blog post of mine or as Theorem IV.2.7 in the graduate textbook "Combinatorial Game Theory" by Aaron N. Siegel.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.