×

Ordinal sums, clockwise hackenbush, and domino shave. (English) Zbl 1500.91024

Nowakowski, Richard J. (ed.) et al., Combinatorial game theory. A special collection in honor of Elwyn Berlekamp, John H. Conway and Richard K. Guy. Berlin: De Gruyter. De Gruyter Proc. Math., 77-98 (2022).
Summary: We present two rulesets, domino shave and clockwise hackenbush. The first is somehow natural and has, as special cases, stirling shave and Hetyei’s Bernoulli game. Clockwise hackenbush seems artificial, yet it is equivalent to domino shave. From the pictorial form of the game and a knowledge of hackenbush, the decomposition into ordinal sums is immediate. The values of clockwise bluered hackenbush are numbers, and we provide an explicit formula for the ordinal sum of numbers where the literal form of the base is \(\{x|\}\) or \(\{|x\}\), and \(x\) is a number. That formula generalizes van Roode’s signed binary number method for blue-red hackenbush.
For the entire collection see [Zbl 1495.91007].

MSC:

91A46 Combinatorial games