Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #14642 > unrolled thread
| Started by | michael partensky <partensky@gmail.com> |
|---|---|
| First post | 2013-05-26 08:39 +0000 |
| Last post | 2013-05-26 08:39 +0000 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.soft-sys.math.mathematica
tossing a coin michael partensky <partensky@gmail.com> - 2013-05-26 08:39 +0000
| From | michael partensky <partensky@gmail.com> |
|---|---|
| Date | 2013-05-26 08:39 +0000 |
| Subject | tossing a coin |
| Message-ID | <knshn8$c7s$1@smc.vnet.net> |
Hi everybody! Here is a classical problem: A and B take turns flipping a coin. H and T designate "heads" and "tails" respectively. Each of them chooses a pattern. Say, A picks HHTT and B picks HTHT (the length of the fragment may vary). One wins if his pattern appears before the pattern of his opponent. For any two patterns we have to find the answer *experimentally (by producing many random sequences and computing the frequencies of wins)*. What would be the most elegant way of detecting the first appearance of a pattern ? Thanks, Michael Partenskii
Back to top | Article view | comp.soft-sys.math.mathematica
csiph-web