10 citations · 18 across the 12 of their papers we have counts for
3 papers · 1 filter
A complete solution for the partisan chocolate game
Tomoaki Abuku, Hikaru Manabe, Richard J. Nowakowski +2
The class of Poset Take-Away games includes many interesting and difficult games. Playing on an -dimensional positive quadrant (the origin being the bottom of the poset) gives r…
Indecomposable combinatorial games
Michael Fisher, Neil A. McKay, Rebecca Milley +2
In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed…
Infinitely many absolute universes
U. Larsson, R. J. Nowakowski, C. P. Santos
Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental univers…