Two players unbalanced coin challenge
up vote
0
down vote
favorite
Given an unbalanced coin that emits H at 2/5 and emits T at 3/5.
Two players, A and B, each choose a different sequence of 3 coin flips, then toss the coin together again and again until they get one of the sequences. The winning player is the player whose sequence was first received. Player A chooses the sequence T T T. Is there a sequence B can choose so that its probability of winning will be greater than half? If so, find this sequence and calculate the probabilities of each player to win. Otherwise, explain why there is no such sequence.
I have made a simulation on my PC trying to figure out the answer first, and found out T H T has a probability greater than half to win (~0.516). But I need help finding a mathematical way to show that...
probability
add a comment |
up vote
0
down vote
favorite
Given an unbalanced coin that emits H at 2/5 and emits T at 3/5.
Two players, A and B, each choose a different sequence of 3 coin flips, then toss the coin together again and again until they get one of the sequences. The winning player is the player whose sequence was first received. Player A chooses the sequence T T T. Is there a sequence B can choose so that its probability of winning will be greater than half? If so, find this sequence and calculate the probabilities of each player to win. Otherwise, explain why there is no such sequence.
I have made a simulation on my PC trying to figure out the answer first, and found out T H T has a probability greater than half to win (~0.516). But I need help finding a mathematical way to show that...
probability
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Given an unbalanced coin that emits H at 2/5 and emits T at 3/5.
Two players, A and B, each choose a different sequence of 3 coin flips, then toss the coin together again and again until they get one of the sequences. The winning player is the player whose sequence was first received. Player A chooses the sequence T T T. Is there a sequence B can choose so that its probability of winning will be greater than half? If so, find this sequence and calculate the probabilities of each player to win. Otherwise, explain why there is no such sequence.
I have made a simulation on my PC trying to figure out the answer first, and found out T H T has a probability greater than half to win (~0.516). But I need help finding a mathematical way to show that...
probability
Given an unbalanced coin that emits H at 2/5 and emits T at 3/5.
Two players, A and B, each choose a different sequence of 3 coin flips, then toss the coin together again and again until they get one of the sequences. The winning player is the player whose sequence was first received. Player A chooses the sequence T T T. Is there a sequence B can choose so that its probability of winning will be greater than half? If so, find this sequence and calculate the probabilities of each player to win. Otherwise, explain why there is no such sequence.
I have made a simulation on my PC trying to figure out the answer first, and found out T H T has a probability greater than half to win (~0.516). But I need help finding a mathematical way to show that...
probability
probability
edited Nov 17 at 10:49
asked Nov 17 at 10:43
T M
32
32
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
3
down vote
accepted
Choosing $HTT$ gives $B$ a $frac {98}{125}=.784$ chance of winning.
Indeed, unless $A$ sees $TTT$ initially it is impossible for $A$ to win (as some Head must be tossed and the first instance of $TTT$ will inevitably be preceded by $HTT$).
Pf: Suppose $TTT$ first occurs starting in toss $n>1$. Then the $(n-1)^{st}$ toss must have been $H$, else we'd have had $TTT$ starting from slot $n-1$. But in that case the block starting from toss $n-1$ is $HTT$.
Of course, $TTT$ occurs initially with probability $left( frac 35right)^3=frac {27}{125}$ so $B$ wins with probability $1-frac {27}{125}=frac {98}{125}$.
Note: $TTT$ is a terrible choice.
Note 2: the calculation from your choice is harder, but perfectly possible. Work with states according to how much of either string has been assembled. Thus we have the states $emptyset, T, TH, TT, TTT, THT$ and look at the various transitions to write down linear equations. A little tedious, but not difficult. the calculation shows that, with this choice, $B$ wins with probability $frac {16}{31}$. Letting $P_S$ denote the probability that $B$ wins given that we start from state $S$, the relevant equations are $$P_{emptyset}=frac 35times P_T+frac 25P_{emptyset}implies P_{emptyset}=P_T$$ $$P_T=frac 35P_{TT}+frac 25P_{TH}$$ $$P_{TH}=frac 35times 1+frac 25P_Tquad &quad P_{TT}=frac 35times 0 +frac 25P_{TH}$$ This is easily solved to get the desired answer $$P_{emptyset}=frac {16}{31}$$
The coin is biased...
– Parcly Taxel
Nov 17 at 11:04
@ParclyTaxel Yes, thanks. I just edited accordingly.
– lulu
Nov 17 at 11:06
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
Choosing $HTT$ gives $B$ a $frac {98}{125}=.784$ chance of winning.
Indeed, unless $A$ sees $TTT$ initially it is impossible for $A$ to win (as some Head must be tossed and the first instance of $TTT$ will inevitably be preceded by $HTT$).
Pf: Suppose $TTT$ first occurs starting in toss $n>1$. Then the $(n-1)^{st}$ toss must have been $H$, else we'd have had $TTT$ starting from slot $n-1$. But in that case the block starting from toss $n-1$ is $HTT$.
Of course, $TTT$ occurs initially with probability $left( frac 35right)^3=frac {27}{125}$ so $B$ wins with probability $1-frac {27}{125}=frac {98}{125}$.
Note: $TTT$ is a terrible choice.
Note 2: the calculation from your choice is harder, but perfectly possible. Work with states according to how much of either string has been assembled. Thus we have the states $emptyset, T, TH, TT, TTT, THT$ and look at the various transitions to write down linear equations. A little tedious, but not difficult. the calculation shows that, with this choice, $B$ wins with probability $frac {16}{31}$. Letting $P_S$ denote the probability that $B$ wins given that we start from state $S$, the relevant equations are $$P_{emptyset}=frac 35times P_T+frac 25P_{emptyset}implies P_{emptyset}=P_T$$ $$P_T=frac 35P_{TT}+frac 25P_{TH}$$ $$P_{TH}=frac 35times 1+frac 25P_Tquad &quad P_{TT}=frac 35times 0 +frac 25P_{TH}$$ This is easily solved to get the desired answer $$P_{emptyset}=frac {16}{31}$$
The coin is biased...
– Parcly Taxel
Nov 17 at 11:04
@ParclyTaxel Yes, thanks. I just edited accordingly.
– lulu
Nov 17 at 11:06
add a comment |
up vote
3
down vote
accepted
Choosing $HTT$ gives $B$ a $frac {98}{125}=.784$ chance of winning.
Indeed, unless $A$ sees $TTT$ initially it is impossible for $A$ to win (as some Head must be tossed and the first instance of $TTT$ will inevitably be preceded by $HTT$).
Pf: Suppose $TTT$ first occurs starting in toss $n>1$. Then the $(n-1)^{st}$ toss must have been $H$, else we'd have had $TTT$ starting from slot $n-1$. But in that case the block starting from toss $n-1$ is $HTT$.
Of course, $TTT$ occurs initially with probability $left( frac 35right)^3=frac {27}{125}$ so $B$ wins with probability $1-frac {27}{125}=frac {98}{125}$.
Note: $TTT$ is a terrible choice.
Note 2: the calculation from your choice is harder, but perfectly possible. Work with states according to how much of either string has been assembled. Thus we have the states $emptyset, T, TH, TT, TTT, THT$ and look at the various transitions to write down linear equations. A little tedious, but not difficult. the calculation shows that, with this choice, $B$ wins with probability $frac {16}{31}$. Letting $P_S$ denote the probability that $B$ wins given that we start from state $S$, the relevant equations are $$P_{emptyset}=frac 35times P_T+frac 25P_{emptyset}implies P_{emptyset}=P_T$$ $$P_T=frac 35P_{TT}+frac 25P_{TH}$$ $$P_{TH}=frac 35times 1+frac 25P_Tquad &quad P_{TT}=frac 35times 0 +frac 25P_{TH}$$ This is easily solved to get the desired answer $$P_{emptyset}=frac {16}{31}$$
The coin is biased...
– Parcly Taxel
Nov 17 at 11:04
@ParclyTaxel Yes, thanks. I just edited accordingly.
– lulu
Nov 17 at 11:06
add a comment |
up vote
3
down vote
accepted
up vote
3
down vote
accepted
Choosing $HTT$ gives $B$ a $frac {98}{125}=.784$ chance of winning.
Indeed, unless $A$ sees $TTT$ initially it is impossible for $A$ to win (as some Head must be tossed and the first instance of $TTT$ will inevitably be preceded by $HTT$).
Pf: Suppose $TTT$ first occurs starting in toss $n>1$. Then the $(n-1)^{st}$ toss must have been $H$, else we'd have had $TTT$ starting from slot $n-1$. But in that case the block starting from toss $n-1$ is $HTT$.
Of course, $TTT$ occurs initially with probability $left( frac 35right)^3=frac {27}{125}$ so $B$ wins with probability $1-frac {27}{125}=frac {98}{125}$.
Note: $TTT$ is a terrible choice.
Note 2: the calculation from your choice is harder, but perfectly possible. Work with states according to how much of either string has been assembled. Thus we have the states $emptyset, T, TH, TT, TTT, THT$ and look at the various transitions to write down linear equations. A little tedious, but not difficult. the calculation shows that, with this choice, $B$ wins with probability $frac {16}{31}$. Letting $P_S$ denote the probability that $B$ wins given that we start from state $S$, the relevant equations are $$P_{emptyset}=frac 35times P_T+frac 25P_{emptyset}implies P_{emptyset}=P_T$$ $$P_T=frac 35P_{TT}+frac 25P_{TH}$$ $$P_{TH}=frac 35times 1+frac 25P_Tquad &quad P_{TT}=frac 35times 0 +frac 25P_{TH}$$ This is easily solved to get the desired answer $$P_{emptyset}=frac {16}{31}$$
Choosing $HTT$ gives $B$ a $frac {98}{125}=.784$ chance of winning.
Indeed, unless $A$ sees $TTT$ initially it is impossible for $A$ to win (as some Head must be tossed and the first instance of $TTT$ will inevitably be preceded by $HTT$).
Pf: Suppose $TTT$ first occurs starting in toss $n>1$. Then the $(n-1)^{st}$ toss must have been $H$, else we'd have had $TTT$ starting from slot $n-1$. But in that case the block starting from toss $n-1$ is $HTT$.
Of course, $TTT$ occurs initially with probability $left( frac 35right)^3=frac {27}{125}$ so $B$ wins with probability $1-frac {27}{125}=frac {98}{125}$.
Note: $TTT$ is a terrible choice.
Note 2: the calculation from your choice is harder, but perfectly possible. Work with states according to how much of either string has been assembled. Thus we have the states $emptyset, T, TH, TT, TTT, THT$ and look at the various transitions to write down linear equations. A little tedious, but not difficult. the calculation shows that, with this choice, $B$ wins with probability $frac {16}{31}$. Letting $P_S$ denote the probability that $B$ wins given that we start from state $S$, the relevant equations are $$P_{emptyset}=frac 35times P_T+frac 25P_{emptyset}implies P_{emptyset}=P_T$$ $$P_T=frac 35P_{TT}+frac 25P_{TH}$$ $$P_{TH}=frac 35times 1+frac 25P_Tquad &quad P_{TT}=frac 35times 0 +frac 25P_{TH}$$ This is easily solved to get the desired answer $$P_{emptyset}=frac {16}{31}$$
edited Nov 17 at 12:12
answered Nov 17 at 10:57
lulu
38.4k24476
38.4k24476
The coin is biased...
– Parcly Taxel
Nov 17 at 11:04
@ParclyTaxel Yes, thanks. I just edited accordingly.
– lulu
Nov 17 at 11:06
add a comment |
The coin is biased...
– Parcly Taxel
Nov 17 at 11:04
@ParclyTaxel Yes, thanks. I just edited accordingly.
– lulu
Nov 17 at 11:06
The coin is biased...
– Parcly Taxel
Nov 17 at 11:04
The coin is biased...
– Parcly Taxel
Nov 17 at 11:04
@ParclyTaxel Yes, thanks. I just edited accordingly.
– lulu
Nov 17 at 11:06
@ParclyTaxel Yes, thanks. I just edited accordingly.
– lulu
Nov 17 at 11:06
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3002197%2ftwo-players-unbalanced-coin-challenge%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown