2023/03/09 by U. Larsson, Richard J. Nowakowski, Larsson, U. +3
Computer Science · Psychology · #Artificial Intelligence in Games #Gambling Behavior and Treatments
paper · pdf · doi:10.48550/arxiv.2303.05198
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 universes of combinatorial games; standard closure properties are satisfied and each pair of non-empty sets of forms of the universe makes a form of the universe. Here we prove that there is an infinite number of absolute misère universes, by recursively expanding the dicot misère universe and the dead-ending universe. On the other hand, we prove that normal-play has exactly two absolute universes, namely the full space, and the universe of all-small games.