The No-Flippancy Game
Combinatorics
2020-06-18 v1 Discrete Mathematics
Abstract
We analyze a coin-based game with two players where, before starting the game, each player selects a string of length comprised of coin tosses. They alternate turns, choosing the outcome of a coin toss according to specific rules. As a result, the game is deterministic. The player whose string appears first wins. If neither player's string occurs, then the game must be infinite. We study several aspects of this game. We show that if, after turns, the game fails to cease, it must be infinite. Furthermore, we examine how a player may select their string to force a desired outcome. Finally, we describe the result of the game for particular cases.
Cite
@article{arxiv.2006.09588,
title = {The No-Flippancy Game},
author = {Isha Agarwal and Matvey Borodin and Aidan Duncan and Kaylee Ji and Tanya Khovanova and Shane Lee and Boyan Litchev and Anshul Rastogi and Garima Rastogi and Andrew Zhao},
journal= {arXiv preprint arXiv:2006.09588},
year = {2020}
}
Comments
16 pages