5 citations · 5 across the 9 of their papers we have counts for
19 papers
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…
Æquitas: Two-Player Counterfeit Coin Games
Kyle Burke, Tanya Khovanova, Joshua Lee +3
We discuss games involving a counterfeit coin. Given one counterfeit coin among a number of otherwise identical coins, two players with full knowledge of the fake coin take turns w…
The game of Flipping Coins
Anthony Bonato, Melissa A. Huggan, Richard J. Nowakowski
We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by…
Impartial games with entailing moves
Urban Larsson, Richard J. Nowakowski, Carlos P. Santos
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke compar…
A Note on Numbers
Alda Carvalho, Melissa A. Huggan, Richard J. Nowakowski +1
When are all positions of a game numbers? We show that two properties are necessary and sufficient. These properties are consequences of that, in a number, it is not an advantage t…
Partizan Subtraction Games
Eric Duchêne, Marc Heinrich, Richard J. Nowakowski +1
Partizan subtraction games are combinatorial games where two players, say Left and Right, alternately remove a number n of tokens from a heap of tokens, with (resp. $n…