Suppose you have a board like the one shown below. The board’s topmost row has three pins (and two slots for a ball to pass through), while the bottommost row has two pins (and three slots for a ball to pass through). The remaining rows alternate between having three pins and two pins. But instead of the 12 rows of pins in the illustrative diagram, suppose the board has many, many rows. And at the very bottom of the board, just below the two bottommost pins, are three buckets, labeled A, B, and C from left to right.
Whenever a ball encounters one of the leftmost pins, it travels down the right side of it to the next row. And whenever a ball encounters one of the rightmost pins, it travels down the left side of it to the next row. But this isn’t your garden variety bean machine. Whenever a ball encounters any of the other pins, it has a 75 percent chance of traveling down the right side of that pin, and a 25 percent chance of traveling down the left side of that pin.
A single ball is about to be dropped into the left slot at the top of the board. What is the probability that the ball ultimately lands in bucket A, the leftmost slot at the bottom?
Let's break down the many, many, many rows of this bean machine into repetitions of a two pin row followed by a three pin row. Let's zoom in on one of these blocks. Assume that the probability that bean will hit the left pin with probability p (and hence the probability it hits the right pin is 1−p). Let's further say that the probability that after it passes through the three pin row that it is leaving down the left slot is q=q(p). Let's work out the relationship between p and q.
As shown in the figure, there are three possible ways that it leaves down the left slot: (a) it hits the left pin in the upper row, goes to the left hitting the leftmost pin in the lower row, then leaves through down the left slot; (b) it hits the left pin in the upper row, goes to the right hitting the middle pin in the lower row, then goes to the left leaving through the left slot; or (c) it hits the right pin in the upper row, goes to the left hitting the middle pin in the lower row, then goes to the left, leaving through the left slot. The total probability of option (a) is p⋅14⋅1=p4. The total probability of option (b) is p⋅34⋅14=3p16. The total probability of option (c) is (1−p)⋅14⋅14=1−p16. Therefore, we see that q=q(p)=p4+3p16+1−p16=6p+116.
Let's say that the probability of hitting the left pin in the nth repitition of these blocks of consecutive two and three pin rows is pn. Then, since the probability of leaving the nth block through the left slot is the same as the probability of hitting the left pin in the (n+1)th block, we have pn+1=6pn+116. If we have a total of N of these blocks, then the probability of ending up in A is given by pA=pN+14. While it isn't entirely super impactful when N is large, we should note that since we are dropping a ball in the left slot that we start with p0=1, from which we can derive the exact probability of getting ending up in A for any N.
For this particular problem, though, where we assume that N≫1 we can just take p∞=limn→∞pn which we can get by plugging p∞ into both sides of the recursion formula, that is, p∞=6p∞+116, or equivalently p∞=110. Therefore, when the number of such blocks grows large, the probability of ending up in A is pA=p∞4=140=2.5%.
No comments:
Post a Comment