The game of flipping coins

DOI10.1515/9783110755411-001MaRDI QIDQ5041700zbMATH OpenOpenAlexFDO

Authors Anthony Bonato, Melissa Huggan, R. J. Nowakowski

Publication date 14 October 2022

Published in Combinatorial Game Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2102.13225

zbMATH Keywords

combinatorial game theoryflipping coinsordinal sum

Mathematics Subject Classification ID

Combinatorial games (91A46)

Abstract: We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by first applying a reduction, then decomposing the position into an iterated ordinal sum. This is unusual since moves in the middle of the line do not eliminate the rest of the line. Moreover, when $G$ is decomposed into lines $H$ and $K$, then $G=(H:K^R)$. This is in contrast to Hackenbush Strings where $G=(H:K)$.

Recommendations

• The game of flipping coins
• A variant of Nim
• scientific article; zbMATH DE number 777903
• The game of Take Turn
• scientific article; zbMATH DE number 988839

Cited in

(4)

• Moving coins
• scientific article; zbMATH DE number 988839 (Why is no real title available?)
• scientific article; zbMATH DE number 988842 (Why is no real title available?)
• The game of flipping coins

This page was built for publication: The game of flipping coins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041700)