Abstract
Abstract
We start by exploring and analyzing the various aspects of Penney’s game, examining its possible outcomes as well as its fairness (or lack thereof). In search of a fairer game, we create many variations of the original Penney’s game by altering its rules. Specifically, we introduce the Head-Start Penney’s game, the Post-a-Bobalyptic Penney’s game, the Second-Occurrence Penney’s game, the Two-Coin game, the No-Flippancy game, and the Blended game. We then analyze each of these games and the odds of winning for both players.
Subject
General Chemical Engineering
Reference10 articles.
1. [Fli20] Isha Agarwal, Matvey Borodin, Aidan Duncan, Kaylee Ji, Tanya Khovanova, Shane Lee, Boyan Litchev, Anshul Rastogi, Garima Rastogi, and Andrew Zhao. “The No-Flippancy Game.” math.CO arXiv:2006.09588 (2020).
2. [WW04] Elwyn R. Berlekamp, John H. Conway and Richard K. Guy. Winning Ways for your Mathematical Plays, 2nd Edition, Volume 4. AK Peters (2004), p. 885.
3. [Col82] Stanley Collings. “Coin Sequence Probabilities and Paradoxes.” Bulletin of the Institute of Mathematics and its Applications 18 (1982): 227–232.
4. [Fel06] Daniel Felix. “Optimal Penney Ante Strategy via Correlation Polynomial Identities.” Electr. J. Comb. 13(1) (2006).10.37236/1061
5. [MGS74] Martin Gardner. “Mathematical Games.” Scientific American, 231(4), (1974): 120–125.10.1038/scientificamerican0774-116