What’s the probability you will make a shot in beer pong, with all cups still on the table? Probably less than 40%!
This post is a dedication to all those beer pong matches I never won. I had the opportunity to play the game recently, and it sparked some thought after I had read about a famous problem in probability Buffon’s Needle :
Imagine dropping a needle onto a hardwood floor, made of panels of equal width. What is the probability that the needle will come to rest lying across a crack between two boards?
In solving the problem, we consider the possible arrangements of the needle and the floorboards. We can do the same with beer pong!
To get a rough estimate of likelihood of sinking a beer pong shot we consider where the ball may land within the entire triangle, and calculate the sum of the areas where, if the ball lands, it will go in a cup.
The percentage of the total area will give a fair approximation of your ability to make a shot, assuming the ball is equally likely to land anywhere within the triangle (a dubious assumption when playing with the well-practiced frat guy).
Surprisingly, despite the fact that roughly 80% of the triangle outlining the cups is covered by the openings of the cups, less than 40% of that area is good for sinking the ball.
The sum of the shaded areas depends on what we allow to be plausible for the ball to enter the cup. Can the ball nick the side and go in still? By how much? I take a range between just nicking the side and striking the edge of the cup at a 45 degree angle.
Using these values will yeild the above table when combined with the formulas below. (note that ‘n’ represents the number of cups in the last row of the triangle, here n == 4)
The area covered by the solo cups :
The area of the surrounding triangle :
which is derived from the side length :
and the formula for the area of an equilateral triagle :
What if the ENTIRE Earth were covered in ping pong balls, and we dropped the ball from space?
Or, in other words, what happens to the probability as we add more and more rows of cups? Here’s a graphical depiction of the upper and lower bounds of the total area of the triangle covered by shaded area as n grows.
Note that, since the beer pong layout is growing large, we require the ball to go into a cup on the first hit (i.e. we don’t count it if it bounces from one cup into another).
As it turns out, this relates to the famous problem of Circle Packing, where we try to achieve the densest possible packing of circles into a given area. As luck would have it, the solo cups are arranged in the densest possible layout for beer pong.
But it, doesn’t look like our luck as much improved even with a larger layout. Our probability just creeps up to about 45% on the upper end.