1 / 14

Stat 35b: Introduction to Probability with Applications to Poker Outline for the day:

Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: Hw, terms, etc. Ly vs. Negreanu (flush draw) example 3. Permutations and combinations “Addition rule”. Examples involving combinations & addition rule. Kolberg/Murphy example R.

jolene-ramirez
Download Presentation

Stat 35b: Introduction to Probability with Applications to Poker Outline for the day:

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: Hw, terms, etc. Ly vs. Negreanu (flush draw) example 3. Permutations and combinations “Addition rule”. Examples involving combinations & addition rule. Kolberg/Murphy example R  u   u 

  2. 1. HW1 terms. “heads up” = 2 players only, “Tc” = 10. 2 pair tiebreaker.2. Ly vs. Negreanu, p66, season 2 episode 6 1:50.3. Permutations and Combinations Basic counting principle: If there are a1 distinct possible outcomes on experiment #1, and for each of them, there are a2 distinct possible outcomes on experiment #2, etc., then there are a1x a2x … x aj distinct possible ordered outcomes on the j experiments. e.g. you get 1 card, opp. gets 1 card. # of distinct possibilities? 52 x 51. [ordered: (A , K) ≠ (K , A) .] Each such outcome, where order matters, is called a permutation. Number of permutations of the deck? 52 x 51 x … x 1 = 52! ~ 8.1 x 1067

  3. A combination is a collection of outcomes, where order doesn’t matter. e.g. in hold’em, how many distinct 2-card hands are possible? 52 x 51 if order matters, but then you’d be double-counting each [ since now (A , K) = (K , A) .] So, the number of distinct hands where order doesn’t matter is 52 x 51 / 2. In general, with n distinct objects, the # of ways to choose k different ones, where order doesn’t matter, is “n choose k” = choose(n,k) = n! . k! (n-k)!

  4. k! = 1 x 2 x … x k. [convention: 0! = 1.] choose (n,k) = (n) = n! . k k! (n-k)! Ex. You have 2 s, and there are exactly 2 s on the flop. Given this info, what is P(at least one more  on turn or river)? Answer: 52-5 = 47 cards left (9 s, 38 others). So n = choose(47,2) = 1081 combinations for next 2 cards. Each equally likely (and obviously mutually exclusive). Two- combos: choose(9,2) = 36. One- combos: 9 x 38 = 342. Total = 378. So answer is 378/1081 = 35.0%. ------------------------------------------------------ Answer #2: Use the addition rule…

  5. ADDITION RULE, revisited….. Axioms (initial assumptions/rules) of probability: P(A) ≥ 0. P(A) + P(Ac) = 1. Addition rule: If A1, A2, A3, … are mutually exclusive, then P(A1 or A2 or A3 or … ) = P(A1) + P(A2) + P(A3) + … A B C As a result, even if A and B might not be mutually exclusive, P(A or B) = P(A) + P(B) - P(A and B). (p6 of book)

  6. Ex. You have 2 s, and there are exactly 2 s on the flop. Given this info, what is P(at least one more  on turn or river)? Answer #1: 52-5 = 47 cards left (9 s, 38 others). So n = choose(47,2) = 1081 combinations for next 2 cards. Each equally likely (and obviously mutually exclusive). Two- combos: choose(9,2) = 36. One- combos: 9 x 38 = 342. Total = 378. So answer is 378/1081 = 35.0%. ------------------------------------------------------ Answer #2: Use the addition rule. P(≥ 1 more ) = P( on turn OR river) = P(on turn) + P( on river) - P(both) = 9/47 + 9/47 - choose(9,2)/choose(47,2) = 19.15% + 19.15% - 3.3% = 35.0%.

  7. Ex. You have AK. Given this, what is P(at least one A or K comes on board of 5 cards)? Wrong Answer: P(A or K on 1st card) + P(A or K on 2nd card) + … = 6/50 x 5 = 60.0%. No: these events are NOT Mutually Exclusive!!! Right Answer: choose(50,5) = 2,118,760 boards possible. How many have exactly one A or K? 6 x choose(44,4) = 814,506 # with exactly 2 aces or kings? choose(6,2) x choose(44,3) = 198,660 # with exactly 3 aces or kings? choose(6,3) x choose(44,2) = 18,920 … … altogether, 1,032,752 boards have at least one A or K, So it’s 1,032,752 / 2,118,760 = 48.7%. Easier way: P(no A and no K) = choose(44,5)/choose(50,5) = 1086008 / 2118760 = 51.3%, so answer = 100% - 51.3% = 48.7%

  8. Example:Poker Royale: Comedians vs. Poker Pros, Fri 9/23/05. Linda Johnson $543,000 Kathy Kolberg $300,000 Phil Laak $475,000 Sue Murphy $155,000 Tammy Pescatelli $377,000 Mark Curry $0. No small blind. Johnson in big blind for $8000. Murphy (8 8). Calls $8,000. Kolberg. (9 9u). Raises to $38,000. Pescatelli (Kh 3) folds, Laak (9 3) folds, Johnson (J 6u) folds. Murphy calls. TV Screen: Kolberg. (9 9u) 81% Murphy (8 8) 19% Flop: 8 10u 10. Murphy quickly goes all in. Kolberg thinks for 2 min, then calls. Laak (to Murphy): “You’re 92% to take it down.” TV Screen: Kolberg. (9 9u) 17% Murphy (8 8)83% Who’s right? (Turn 9 river Au), so Murphy is eliminated. Laak went on to win.

  9. TV Screen: Kolberg. (9 9u) 81% Murphy (8 8) 19% Flop: 8 10u 10. Murphy quickly goes all in. Kolberg thinks for 2 min, then calls. Laak (to Murphy): “You’re 92% to take it down.” TV Screen: Kolberg. (9 9u)17% Murphy (8 8)83% Cardplayer.com: 16.8%83.2% Laak (about Kolberg): “She has two outs twice.” P(9 on the turn or river, given just their 2 hands and the flop)? = P(9 on turn) + P(9 on river) - P(9 on both) = 2/45 + 2/45 - 1/choose(45,2) = 8.8%Given other players’ 6 cards? Laak had a 9, so it’s 1/39 + 1/39 = 5.1%

  10. TV Screen: Kolberg. (9 9u) 81% Murphy (8 8) 19% Flop: 8 10u 10. Murphy quickly goes all in. Kolberg thinks for 2 min, then calls. Laak (to Murphy): “You’re 92% to take it down.” TV Screen: Kolberg. (9 9u)17% Murphy (8 8)83% Cardplayer.com: 16.8%83.2% other players’ 6 cards? Laak had a 9, so it’s 1/39 + 1/39 = 5.1% Given just their 2 hands and the flop, what is P(9 or T on the turn or river, but not 98 or T8)? P(9 or T on the turn) + P(9 or T on river) - P(9T) – [P(98) + P(T8)] = 4/45 + 4/45 - [choose(4,2) + 2 + 2]/choose(45,2) = 16.77%

  11. Reminder: no class or OH Thur Jan 19. To download and install R, go directly to cran.stat.ucla.edu, or as it says in the book at the bottom of p157, you can start at www.r-project.org, in which case you click on “download R”, scroll down to UCLA, and click on cran.stat.ucla.edu. From there, click on “download R for …”, and then get the latest version.

  12. Reminder: no class or OH Thur Jan 19. To download and install R, go directly to cran.stat.ucla.edu, or as it says in the book at the bottom of p157, you can start at www.r-project.org, in which case you click on “download R”, scroll down to UCLA, and click on cran.stat.ucla.edu. From there, click on “download R for …”, and then get the latest version.

  13. Reminder: no class or OH Thur Jan 19. To download and install R, go directly to cran.stat.ucla.edu, or as it says in the book at the bottom of p157, you can start at www.r-project.org, in which case you click on “download R”, scroll down to UCLA, and click on cran.stat.ucla.edu. From there, click on “download R for …”, and then get the latest version.

  14. Reminder: no class or OH Thur Jan 19. To download and install R, go directly to cran.stat.ucla.edu, or as it says in the book at the bottom of p157, you can start at www.r-project.org, in which case you click on “download R”, scroll down to UCLA, and click on cran.stat.ucla.edu. From there, click on “download R for …”, and then get the latest version.

More Related