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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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