3 citations · 3 across the 6 of their papers we have counts for
6 papers
Simple Chopsticks: Playing with any number of hands and fingers
Antoine Dailly, Valentin Gledel, Richard J. Nowakowski +1
Chopsticks is a game played by two players where they start with one finger raised on each hand. On their turn, each player moves by pointing an attacking hand at one of their oppo…
Affine Normal Play
Urban Larsson, Richard J. Nowakowski, Carlos P. Santos
There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of…
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…
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…
When game comparison becomes play: Absolutely Categorical Game Theory
Urban Larsson, Richard J. Nowakowski, Carlos P. Santos
Absolute Universes of combinatorial games, as defined in a recent paper by the same authors, include many standard short normal- misère- and scoring-play monoids. In this note we s…