Log In Sign Up

Atomic weights and the combinatorial game of Bipass

by   Urban Larsson, et al.

We define an all-small ruleset, Bipass, within the framework of normal-play combinatorial games. A game is played on finite strips of black and white stones. Stones of different colors are swapped provided they do not bypass one of their own kind. We find a surjective function from the strips to integer atomic weights (Berlekamp, Conway and Guy 1982) that measures the number of units in all-small games. This result provides explicit winning strategies for many games, and in cases where it does not, it gives narrow bounds for the canonical form game values. We prove that the game value *2 does not appear as a disjunctive sum of Bipass. Moreover, we find game values for some parametrized families of games, including an infinite number of strips of value *.


page 1

page 2

page 3

page 4


Constructive comparison in bidding combinatorial games

A class of discrete Bidding Combinatorial Games that generalize alternat...

Infinite Hex is a draw

We introduce the game of infinite Hex, extending the familiar finite gam...

Transfinite game values in infinite draughts

Infinite draughts, or checkers, is played just like the finite game, but...

Impartial games with entailing moves

Combinatorial Game Theory has also been called `additive game theory', w...

Cumulative subtraction games

We study zero-sum games, a variant of the classical combinatorial Subtra...

Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings

The concept of nimbers–a.k.a. Grundy-values or nim-values–is fundamental...

Sprague-Grundy values and complexity for LCTR

Given a Young diagram on n boxes as a non-increasing sequence of integer...