10 citations · 36 across the 43 of their papers we have counts for
47 papers
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…
Constructive comparison in bidding combinatorial games
Prem Kant, Urban Larsson, Ravi K. Rai +1
A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning opt…
Bidding combinatorial games
Prem Kant, Urban Larsson, Ravi K. Rai +1
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention…
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…