Re: tossing a coin
- To: mathgroup at smc.vnet.net
- Subject: [mg130964] Re: tossing a coin
- From: Dana <dana.onthebeach at hotmail.com>
- Date: Wed, 29 May 2013 03:58:51 -0400 (EDT)
- Delivered-to: l-mathgroup@mail-archive0.wolfram.com
- Delivered-to: l-mathgroup@wolfram.com
- Delivered-to: mathgroup-outx@smc.vnet.net
- Delivered-to: mathgroup-newsendx@smc.vnet.net
Hi. Here's just one of a few ways.
In this small example, person #2 had his pattern start at position #6.
One would probably want to have a sample larger than 30 thou.
// represent flips of a coin
k=StringJoin@@RandomChoice[{"h","t"},30]
tthtthththhhttthhhhhtttththttt
StringPosition[k,"hhtt"][[1,1]]
11
StringPosition[k,"htht"][[1,1]]
6
= = = = = = = = = =
HTH :>)
Dana DeLouis
Mac & Mathematica 9
= = = = = = = = = =
On Sunday, May 26, 2013 4:39:04 AM UTC-4, michael partensky wrote:
> 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