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 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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