You’re playing a game of cornhole with your friends, and it’s your turn to toss the four bean bags. For every bean bag you toss onto your opponents’ board, you get 1 point. For every bag that goes through the hole on their board, you get 3 points. And for any bags that don’t land on the board or through the hole, you get 0 points.
Your opponents had a terrible round, missing the board with all their throws. Meanwhile, your team currently has 18 points — just 3 points away from victory at 21. You’re also playing with a special house rule: To win, you must score exactly 21 points, without going over.
Based on your history, you know there are three kinds of throws you can make: (1) An aggressive throw, which has a 40 percent chance of going in the hole, a 30 percent chance of landing on the board and a 30 percent chance of missing the board and hole; (2) a conservative throw, which has a 10 percent chance of going in the hole, an 80 percent chance of landing on the board and a 10 percent chance of missing the board and hole; or (3) a wasted throw, which has a 100 percent chance of missing the board and hole.
For each bean bag, you can choose any of these three throws. Your goal is to maximize your chances of scoring exactly 3 points with your four tosses. What is the probability that your team will finish the round with exactly 21 points and declare victory?
Let's denote the three types of throw strategies as A for aggressive, C for conservative and W for wasted. Let Sk be the score after the kth throw of this turn (with S0=18). Based on the strategy, the score will evolve probabilistically according to probability laws PA, PC or PW, respectively, as described above. We only care about ending up with S4=21 and should set V(S)=δ(S−21)={1,if S=21;0,if S≠21.Wecanalsothinkofthescoreintermsoffivestates\mathcal{S} = \{18, 19, 20, 21, \gt 21\}$ to make the problem more manageable.
If we start with the final utility V4=V as above, then working backwards, we get Vk−1(s)=maxu∑σ∈SPu{Sk=σ∣Sk−1=s}Vk(σ), for each s∈S. Ultimately, we are looking for the value of V0(18), which we will use backwards induction to infer.
Intuitively, the optimal values should be ˆu(21)=ˆu(>21)=W, as in either case there is no additional benefit to scoring any more points (either you have already lost or would lose if any more points are scored). Then we will always have Vk(21)=1 and Vk(>21)=0 for all k=1,2,3,4.
Moving to s=20, we get Vk−1(20)=max{0.3Vk(20)+0.3Vk(21)+0.4Vk(>21),0.1Vk(20)+0.8Vk(21)+0.1Vk(>21),Vk(20)}=max{0.3Vk(20)+0.3,0.1Vk(20)+0.8,Vk(20)}, with final condition V4(20)=0. Therefore, we have V3(20)=0.8, V2(20)=0.88, and V1(20)=0.888. Note that for s=20, the optimal choice is always ˆu(20)=C.
Dropping down to s=19, we get Vk−1(19)=max{0.3Vk(19)+0.3Vk(20)+0.4Vk(>21),0.1Vk(19)+0.8Vk(20)+0.1Vk(>21),Vk(19)}=max{0.3Vk(19)+0.3Vk(20),0.1Vk(19)+0.8Vk(20),Vk(20)}, with final condition V4(19)=0. Therefore, we have V3(19)=0, V2(19)=0.64, and V1(19)=0.768. For s=19, the optimal choice (except for ˆu4 where all options are equally worthless) is ˆu(19)=C.
Moving to s=18, we have Vk−1(18)=max{0.3Vk(18)+0.3Vk(19)+0.4Vk(21),0.1Vk(18)+0.8Vk(19)+0.1Vk(21),Vk(18)}=max{0.3Vk(18)+0.3Vk(19)+0.4,0.1Vk(18)+0.8Vk(19)+0.1,Vk(18)}, with final condition V4(18)=0. Therefore we have V3(18)=0.4, V2(18)=0.52 and V1(18)=0.748 and V0(18)=0.8548. Note again here that we also have ˆu(18)=A regardless of the number of bean bags already tossed during your turn. So with a uniform strategy of agressive toss if you are currently at S=18; a conservative toss if you are currently at S∈{19,20}; and wasted toss if your score is S≥21, we get the probability of winning during your next turn as V0(18)=85.48%.
No comments:
Post a Comment