Hi, I'm trying learn about combinatorial game theory. Could anyone provide me links on tutorials game theories such as nim, sprague-grundy theorem etc. which will be quite easy to understand?
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
Hi, I'm trying learn about combinatorial game theory. Could anyone provide me links on tutorials game theories such as nim, sprague-grundy theorem etc. which will be quite easy to understand?
| Name |
|---|



http://www.numericana.com/answer/games.htm
Hey mkirsche, thanks for link! :) Could you provide me some more links on how to calculate the grundy numbers? It would be really helpful!
I think this page explains it pretty well: https://www.topcoder.com/community/data-science/data-science-tutorials/algorithm-games/. Basically, the way you calculate Grundy Numbers (also called Nimbers) to a game state as follows. If it's a losing state (no moves can be made), assign it a a Grundy number of 0. Otherwise, consider all Grundy numbers of states that can be reached in a single move. Then, the lowest non-negative number that is not among that set is the Grundy number of the current state.
Hi JediMaster2015, I made a few tutorials on Grundy Numbers and the Sprague Grundy Theorem. Here is the playlist: https://www.youtube.com/playlist?list=PLMCXHnjXnTnuolrTKzZkTMGmQNEP3NaBa
great videos