10 citations · 28 across the 31 of their papers we have counts for
4 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…
A complete solution for a nontrivial ruleset with entailing moves
Urban Larsson, Richard J. Nowakowski, Carlos P. Santos
Combinatorial Game Theory typically studies sequential rulesets with perfect information where two players alternate moves. There are rulesets with {\em entailing moves} that break…
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…