{"id":1045,"date":"2015-09-13T17:04:20","date_gmt":"2015-09-13T09:04:20","guid":{"rendered":"http:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/?p=1045"},"modified":"2024-02-16T21:09:14","modified_gmt":"2024-02-16T13:09:14","slug":"a-probability-puzzle-from-dilberts-author","status":"publish","type":"post","link":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/2015\/09\/a-probability-puzzle-from-dilberts-author\/","title":{"rendered":"A Probability Puzzle From Dilbert&#8217;s Author"},"content":{"rendered":"<p>I&#8217;ve been reading <a href=\"http:\/\/amzn.to\/1KfniFS\" target=\"_blank\" rel=\"noopener\">this book<\/a>, by Scott Adams, the author of Dilbert. Inside, I found a probability puzzle!<\/p>\n<p>Scott Adams talks about Volleyball games, and how he noticed that the team that reaches 17 first usually wins. (A win in volleyball is 25 points.)<\/p>\n<p><!--more--><\/p>\n<p>The probability puzzle is: what, exactly, is the chance of this happening? Scott Adams probably doesn&#8217;t realize he&#8217;s posed a probability puzzle, but he has!<\/p>\n<p>Here&#8217;s how I solved it. If you want to have a crack at it yourself, stop reading now, and come back later.<\/p>\n<p>I imagined that the outcome of a rally is decided, effectively, by random chance &#8211; team A wins p of the time, and team B wins 1-p of the time. For simplicity, I&#8217;ll write 1-p as q sometimes.<\/p>\n<p>First I worked out P<sub>n,k<\/sub>, the chance that team B has k\u00a0points when team A scores their nth point.<\/p>\n<p>This is really easy to work out &#8211; the simplest method is to visit Wikipedia and read about the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Negative_binomial_distribution\" target=\"_blank\" rel=\"noopener\">Negative Binomial distribution<\/a>. There you&#8217;ll find\u00a0a simple formula for\u00a0P<sub>n,k<\/sub>, namely<\/p>\n<p>P<sub>n,k<\/sub>\u00a0= <sup>n+k-1<\/sup>C<sub>k<\/sub> p<sup>n<\/sup>q<sup>k<\/sup><\/p>\n<p>Next, I said\u00a0Q<sub>n,k<\/sub>\u00a0is the chance that team A gets n points before team B gets k. For example,\u00a0\u00a0Q<sub>25,25<\/sub>\u00a0would be the chance that team A wins the volleyball match.<\/p>\n<p>Q<sub>n,k<\/sub>\u00a0is the sum of\u00a0\u00a0P<sub>n,i<\/sub>\u00a0as i\u00a0ranges from 0 to k-1. There may be a way to convert\u00a0this sum into a simple formula, but I was going to ask a computer to do the heavy lifting anyway, so I didn&#8217;t bother.<\/p>\n<p>Next, I said\u00a0\u00a0R<sub>n,m<\/sub>\u00a0is the chance that team A gets m points first, and then gets to n points first.<\/p>\n<p>When team A gets to m points first, team B could have any number of points from 0 to m-1. The chance of each of these is given by the P<sub>n,k<\/sub>. Then, for A to get to n points before B, they need another n-m points before B can clinch another n-k. Since m is bigger than k, you&#8217;d think this would be easy. Whatever it is, it&#8217;s given by\u00a0\u00a0Q<sub>n-m,n-k<\/sub><\/p>\n<p>To find\u00a0R<sub>n,m<\/sub>\u00a0we can add the products \u00a0P<sub>m,k<\/sub>\u00a0\u00a0\u00d7\u00a0Q<sub>n-m,n-k<\/sub>\u00a0as k ranges from 0 to m-1.<\/p>\n<p>R<sub>17,25<\/sub>\u00a0is not quite the answer to Scott Adams&#8217; puzzle, because we don&#8217;t really care which team wins.<\/p>\n<p>R<sub>n,m<\/sub>\u00a0depends on the chance of A winning, which is p. We can say\u00a0\u00a0R<sub>n,m<\/sub>\u00a0=\u00a0\u00a0R<sub>n,m<\/sub>(p). The answer to the puzzle is\u00a0S<sub>n,m<\/sub>\u00a0=\u00a0\u00a0R<sub>n,m<\/sub>(p) +\u00a0\u00a0R<sub>n,m<\/sub>(1-p).<\/p>\n<p>Each formula given above is a relatively simple sum, although disentangling the sums into a single formula involving p might be quite difficult.<\/p>\n<p>It turns out that S<sub>17,25<\/sub>\u00a0is actually very high. The lowest it gets is 80.9%, when the teams are perfectly matched.<\/p>\n<p>Here&#8217;s a graph of \u00a0S<sub>17,25<\/sub>\u00a0or different values of p:<\/p>\n<figure id=\"attachment_1048\" aria-describedby=\"caption-attachment-1048\" style=\"width: 628px\" class=\"wp-caption aligncenter\"><a href=\"http:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1725.png\"><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-1048\" src=\"http:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1725.png\" alt=\"Plot of the probabilities for the Dilbert author's probability puzzle\" width=\"628\" height=\"353\" srcset=\"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1725.png 628w, https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1725-300x169.png 300w\" sizes=\"(max-width: 628px) 100vw, 628px\" \/><\/a><figcaption id=\"caption-attachment-1048\" class=\"wp-caption-text\">Plot of the probabilities for the Dilbert author&#8217;s probability puzzle<\/figcaption><\/figure>\n<p>As you can see, even if the teams are slightly mismatched, the probability of confirming the Dilbert author&#8217;s observation shoots up dramatically. It&#8217;s no wonder then.<\/p>\n<p>In fact, you can often pick the winner as soon as one of the teams reaches 13 points. Here&#8217;s the graph of \u00a0S<sub>13,25<\/sub><\/p>\n<figure id=\"attachment_1049\" aria-describedby=\"caption-attachment-1049\" style=\"width: 633px\" class=\"wp-caption aligncenter\"><a href=\"http:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1325.png\"><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-1049\" src=\"http:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1325.png\" alt=\"The chance that the first team to reach 13 points ends up winning\" width=\"633\" height=\"335\" srcset=\"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1325.png 633w, https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-content\/files\/2015\/09\/Plot-of-S1325-300x159.png 300w\" sizes=\"(max-width: 633px) 100vw, 633px\" \/><\/a><figcaption id=\"caption-attachment-1049\" class=\"wp-caption-text\">The chance that the first team to reach 13 points ends up winning<\/figcaption><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>I&#8217;ve been reading this book, by Scott Adams, the author of Dilbert. Inside, I found a probability puzzle! Scott Adams talks about Volleyball games, and how he noticed that the team that reaches 17 first usually wins. (A win in volleyball is 25 points.)<\/p>\n","protected":false},"author":1,"featured_media":1046,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,258],"tags":[543,108,542],"_links":{"self":[{"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/posts\/1045"}],"collection":[{"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/comments?post=1045"}],"version-history":[{"count":2,"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/posts\/1045\/revisions"}],"predecessor-version":[{"id":1274,"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/posts\/1045\/revisions\/1274"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/media\/1046"}],"wp:attachment":[{"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/media?parent=1045"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/categories?post=1045"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.dr-mikes-math-games-for-kids.com\/blog\/wp-json\/wp\/v2\/tags?post=1045"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}