Expected number of questions to win a game

Let, a person is taking part in a quiz competition. For each questions, there are 3 answers, and for each correct answer he gets 1 point.

When he gets 5 points, he wins the game.

If he gives 2 consecutive wrong answers, then his points resets to zero (i.e. if his score is now 4 and he gives 2 wrong answers, then his score resets to 0).

My question is, on an average how much questions he needs to answer to win the game?

Re: Expected number of questions to win a game

Quote:

Originally Posted by

**concept** Let, a person is taking part in a quiz competition. For each questions, there are 3 answers, and for each correct answer he gets 1 point. When he gets 5 points, he wins the game.

If he gives 2 consecutive wrong answers, then his points resets to zero (i.e. if his score is now 4 and he gives 2 wrong answers, then his score resets to 0). On an average how much questions he needs to answer to win the game?

This seems to be quite complicated. The difficulty will in modeling the outcomes.

This person can win on the game.

If the person gets to play the and does not win, then the score must reset.

Now that is not to say that the score does not reset before the tenth game.

In fact, it could reset after the second game.

Have you worked with *conditional expectation*?

Re: Expected number of questions to win a game

Yes, I know about conditional probability, but I can not figure out how to solve this problem :(

Re: Expected number of questions to win a game

Quote:

Originally Posted by

**concept** Yes, I know about conditional probability, but I can not figure out how to solve this problem :(

No it is not conditional __probability__, it is **conditional **__expectation__.

Re: Expected number of questions to win a game

Quote:

Originally Posted by

**Plato** No it is not conditional __probability__, it is **conditional **__expectation__.

I did not work with conditional expectation. I searched in "Probability and Statistics- walpole" but could not find. Then found in wikipedia, but could not understand properly.

Could you please give hints how to solve the problem using conditional expectation or without using conditional expectation?

Thank you

Re: Expected number of questions to win a game

Re: Expected number of questions to win a game

Quote:

Originally Posted by

**concept** Let, a person is taking part in a quiz competition. For each questions, there are 3 answers, and for each correct answer he gets 1 point.

When he gets 5 points, he wins the game.

If he gives 2 consecutive wrong answers, then his points resets to zero (i.e. if his score is now 4 and he gives 2 wrong answers, then his score resets to 0).

My question is, on an average how much questions he needs to answer to win the game?

Is the person randomly guessing answers? If yes, suppose we start from the beginning or, from a "reset to zero".

Let n = the number of questions answered to win, l = the # of losses, w = the # of wins

n = l + w, and as mentioned . The probability of winning in 5 questions is simple (1/3)^5. Note that the winning string of letters must consist of the substrings W and LW (any combinations of these does not result in a "Reset"). e.g. n = 6 = LW W LW W (as just one possibility). Now, P(W) = 1/3 and P(LW)=2/9, and we can find the probability of winning after n questions by:

i.e. LW W W W W

i.e. LW LW W W W

i.e. LW LW LW W W

i.e. LW LW LW LW W

i.e. LW LW LW LW LW

The one thing I don't have time to help you with is the conditional probability prior to having won (according to the above possibilities). So, you must calculate the probability of seeing a string that combines LW's and W's and then LL at the end (so, in this case, you can't have more than 4 wins, or else you've won already!). This part is quite complicated, because you could have a large number of "resets to zero", and these particular strings would be in various sizes. Seems like it would take less time to do this via a computer program to play this game thousands of times to estimate the answer.

Re: Expected number of questions to win a game

Re: Expected number of questions to win a game

Quote:

Originally Posted by

**Plato** There is a problem with those calculations without further assumptions.

They are correct with no resets.

But

is possible with a reset on

.

Thus

That is no resets plus one reset.

Now for

we could have a reset on

or none at all.

Yes, that was my intent, to only calculate a "winning" string. I agree with your addition to the problem, and I stand by my original comment that it would be difficult to include all possibilities (especially for large n) without the aid of some kind of computer assisted code. My hunch is that a "nice", explicit solution is out of reach.