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?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/25/2026 17:08:59 (g1).
Desktop version, switch to mobile version.
Supported by
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