activity
20152025
most citedAbsolute Combinatorial Game Theory

10 citations · 18 across the 12 of their papers we have counts for

collaborators

13 papers

math.CO2025

Cyclic impartial games with carry-on moves

Tomoaki Abuku, Alda Carvalho, Urban Larsson +3

In an impartial combinatorial game, both players have the same options in the game and all its subpositions. The classical Sprague-Grundy Theory was developed for short impartial g…

math.CO2024

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…

math.CO2023

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…

math.CO2023

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…

math.CO2023

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…

math.CO2021

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…