Timeline for Motivation and Intuition for Sprague-Grundy Theorem
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 1, 2013 at 4:01 | comment | added | Douglas Zare | I guess I should have included $\omega, 2\omega, 4\omega, ... \omega^2, 2\omega^2, ...$ among the primes in case you are considering well-founded games with infinitely many options. | |
| Apr 1, 2013 at 3:41 | history | edited | Douglas Zare | CC BY-SA 3.0 |
added a little more about Nim
|
| Apr 1, 2013 at 1:48 | comment | added | Mark Wildon | Just to expand on the final line: in the game $G + \star n$, if the first player plays to $\star m$ in $G$ where $m < n$, then the second player can play in $\star n$ to give $\star m + \star m = 0$; if the first player plays to $\star m'$ in $\star n$ where $m' < n$ then the second player can play in $G$ to $\star m'$ to give $\star m' + \star m' = 0$. (We know that $\star m'$ is an option of $G$ because $n$ is the minimum excluded option.) Hence $G + \star n = 0$ and $G = \star n$. | |
| Mar 31, 2013 at 23:25 | history | answered | Douglas Zare | CC BY-SA 3.0 |