2 papers
cs.CC2024
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers
Kyle Burke, Matthew Ferland, Svenja Huntemann +1
In this paper, we address a natural question at the intersection of combinatorial game theory and computational complexity: "Can a sum of simple tepid games in canonical form be in…
math.CO2012
Impartial coloring games
Gabriel Beaulieu, Kyle Burke, Eric Duchêne
Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of colors. Each different ruleset specifies that game's colori…