activity
20092024
most citedAbsolute Combinatorial Game Theory

10 citations · 36 across the 43 of their papers we have counts for

collaborators
Showing 2015Show all

8 papers · 1 filter

math.CO2015

Finding Golden Nuggets by Reduction

Urban Larsson, Neil A. McKay, Richard J. Nowakowski +1

We introduce a class of normal play partizan games, called Complementary Subtraction. Let denote your favorite set of positive integers. This is Left's subtraction set, whereas…

math.CO2015

Global Fibonacci Nim

Urban Larsson, Simon Rubinstein-Salzedo

Fibonacci nim is a popular impartial combinatorial game, usually played with a single pile of stones. The game is appealing due to its surprising connections with the Fibonacci num…

math.CO2015

A Cellular Automaton for Blocking Queen Games

Matthew Cook, Urban Larsson, Turlough Neary

We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game,…

math.CO2015

Guaranteed Scoring Games

Urban Larsson, João P. Neto, Richard J. Nowakowski +1

The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include,…

math.CO2015★ 5 cited

When waiting moves you in scoring combinatorial games

Urban Larsson, Richard J. Nowakowski, Carlos P. Santos

Combinatorial Scoring games, with the property `extra pass moves for a player does no harm', are characterized. The characterization involves an order embedding of Conway's Normal-…

math.CO2015★ 1 cited

An Aperiodic Subtraction Game of Nim-dimension Two

Urban Larsson

In a recent arXiv-manuscript Fox studies infinite subtraction games with a finite (ternary) and aperiodic Sprague-Grundy function. Here we provide an elementary example of a game w…