10 citations · 36 across the 43 of their papers we have counts for
35 papers · 1 filter
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…
Subtraction games in more than one dimension
Urban Larsson, Indrajit Saha, Makoto Yokoo
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtra…
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…
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…
Atomic weights and the combinatorial game of Bipass
Urban Larsson, Richard J. Nowakowski
We define an all-small ruleset, Bipass, within the framework of normal-play combinatorial games. A game is played on finite strips of black and white stones. Stones of different co…
Memgames
Urban Larsson, Simon Rubinstein-Salzedo, Aaron N. Siegel
In this article, we study the structure, and in particular the Grundy values, of a family of games known as memgames.