Question: A backgammon player will be playing three consecutive matches with friends tonight. For each match, he will have the opportunity to place an even bet

A backgammon player will be playing three consecutive matches with friends tonight. For each match, he will have the opportunity to place an even bet that he will win; the amount bet can be any quantity of his choice between zero and the amount of money he still has left after the bets on the preceding matches. For each match, the probability is ½ that he will win the match and thus win the amount bet, whereas the probability is ½ that he will lose the match and thus lose the amount bet. He will begin with $75, and his goal is to have $100 at the end. (Because these are friendly matches, he does not want to end up with more than $100.) Therefore, he wants to find the optimal betting policy (including all ties) that maximizes the probability that he will have exactly $100 after the three matches.
Use dynamic programming to solve this problem.

Step by Step Solution

3.31 Rating (169 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Let s n be the current fortune of the player A be the event to have 10... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

545-M-S-L-P (628).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!