Playing Several Patterns Against One Another
classification
🧮 math.PR
keywords
gamepatternsseveralanotherblomchoosescoincompute
read the original abstract
We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning this game, and find the distribution of the game's duration. Our presentation is an extension (and perhaps a simplification) of the results of Blom and Thornburn.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.