The third and final post on impartial games is out. Nothing to crazy, just some more in-depth examples of the Sprague-Grundy theorem in action.
@FreddyR I have a very poorly written blog post that might interest you.
@FreddyR Also, here's a research question I don't know the answer to. Many two-player games are either PSPACE-complete or EXPTIME-complete, mostly depending on whether there is a polynomial bound on the number of moves. Is it possible to prove hardness of this type for a subtraction game with a single pile of stones? There's a result sort of like this at the end of https://dspace.cvut.cz/bitstream/handle/10467/82669/F8-DP-2019-Lomic-Simon-thesis.pdf but it's for a generalized kind of game "subtraction with hotspots" not a pure impartial subtraction game.
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!