Atomic weights and the combinatorial game of \textsc{bipass}
From MaRDI portal
Publication:2099475
Abstract: 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 *.
Recommendations
Cites work
- A nontrivial surjective map onto the short Conway group
- Advances in losing
- An introduction to clobber
- Canonical forms of uptimals
- Combinatorial game theory
- Cutthroat, an all-small game on graphs
- Dicots, and a taxonomic ranking for misère games
- scientific article; zbMATH DE number 6490916 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 1944402 (Why is no real title available?)
- scientific article; zbMATH DE number 7150425 (Why is no real title available?)
- Impartial games with entailing moves
- Lessons in play. An introduction to combinatorial game theory
- Misère-play Hackenbush sprigs
- Outcomes of partizan Euclid
- The game of End-Nim
- Toppling conjecture
- Winning ways for your mathematical plays. Vol. 1.
- Wythoff partizan subtraction
- Yellow-brown Hackenbush
Cited in
(2)
This page was built for publication: Atomic weights and the combinatorial game of \textsc{bipass}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099475)