Suppose someone bets (or raises) you, going all-in. What should your chances of winning be in order for you to correctly call? Let B = the amount bet to.

Slides:



Advertisements
Similar presentations
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Zelda, continued. 2.Difficult homework 3 problem. 3.WSOP 2013 hand.
Advertisements

Short Stack Strategy – How to play after the flop Strategy: No Limit.
Mathematics and the Game of Poker
Intelligence for Games and Puzzles1 Poker: Opponent Modelling Early AI work on poker used simplified.
Intro to Probability & Games
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Ly vs Negreanu. 2.Flush draws and straight draws 3.Project B teams.
Texas Holdem Poker With Q-Learning. First Round (pre-flop) PlayerOpponent.
Overview Odds Pot Odds Outs Probability to Hit an Out
Online Poker James Gilman. Topics ●Hand Probabilities ●Betting Odds ●Odds of winning ●Expected Value ●Decision Making ●Poker Statistics ●Variance.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Straight draws. 2.HW2 clarification. 3.Greenstein vs. Farha AA.
Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)
Introduction for Rotarians
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hand in hw4. 2.Review list 3.Tournament 4.Sample problems * Final.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 0. Collect hw2, return hw1, give out hw3. 1.Project A competition.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Midterm. 2.Review of Bernoulli and binomial random variables. 3.Geometric.
Stat 35: Introduction to Probability with Applications to Poker Outline for the day: 1.Addiction 2.Syllabus, etc. 3. Wasicka/Gold/Binger Example 4.Meaning.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Collect Hw4. 2.Review list. 3.Answers to hw4. 4.Project B tournament.
Decision Theory: Outcomes and Consequences Not Considered Decision Outcomes Consequences Decision: choose between betting on green or red chip. Objective:
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day, Tue 3/13/12: 1.Collect Hw WSOP main event. 3.Review list.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.hw, terms, etc. 2.WSOP example 3. permutations, and combinations.
Shortstack Strategy: How do you play before the flop? Strategy: No Limit.
The challenge of poker NDHU CSIE AI Lab 羅仲耘. 2004/11/04the challenge of poker2 Outline Introduction Texas Hold’em rules Poki’s architecture Betting Strategy.
Outline for the day: 1.Discuss handout / get new handout. 2.Teams 3.Example projects 4.Expected value 5.Pot odds calculations 6.Hansen / Negreanu 7.P(4.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Addiction 2.Syllabus, etc. 3. Wasicka/Gold/Binger Example 4.Meaning.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.HW3 2.Project B teams 3.Gold vs. Helmuth 4.Farha vs. Gold 5.Flush.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Deal-making and expected value 2.Odds ratios, revisited 3.Variance.
Stat 35b: Introduction to Probability with Applications to Poker Poker Code competition: all-in or fold.   u 
MIT 15.S50 L ECTURE 5 Friday, January 27 th, 2012.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1. Review list 2.Bayes’ Rule example 3.CLT example 4.Other examples.
Texas Hold’em Playing Styles Team 4 Matt Darryl Alex.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Expected value and pot odds, continued 2.Violette/Elezra example.
All In To put all the rest of your money into the pot.
Expected value (µ) = ∑ y P(y) Sample mean (X) = ∑X i / n Sample standard deviation = √[∑(X i - X) 2 / (n-1)] iid: independent and identically distributed.
Introduction to Poker Originally created by Albert Wu,
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Odds ratios revisited. 2.Gold/Hellmuth. 3.Deal making. 4.Variance.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hw, terms, etc. 2.Ly vs. Negreanu (flush draw) example 3. Permutations.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hand in hw1! Get hw2. 2.Combos, permutations, and A  vs 2  after.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Tournaments 2.Review list 3.Random walk and other examples 4.Evaluations.
1)Hand in HW. 2)No class Tuesday (Veteran’s Day) 3)Midterm Thursday (1 page, double-sided, of notes allowed) 4)Review List 5)Review of Discrete variables.
(Day 14 was review. Day 15 was the midterm.) Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Return and review.
Outline: 1) Odds ratios, continued. 2) Expected value revisited, Harrington’s strategy 3) Pot odds 4) Examples.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1. Combos, permutations, and A  vs 2  after first ace 2.Conditional.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Expected value. 2.Heads up with AA. 3.Heads up with Gus vs.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Review List 2.Review of Discrete variables 3.Nguyen / Szenkuti.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hw, terms, etc. 2.Ly vs. Negreanu (flush draw) example 3. Permutations.
Texas Holdem A Poker Variant vs. Flop TurnRiver. How to Play Everyone is dealt 2 cards face down (Hole Cards) 5 Community Cards Best 5-Card Hand Wins.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
HOW TO PLAY POKER.
Presentation transcript:

Suppose someone bets (or raises) you, going all-in. What should your chances of winning be in order for you to correctly call? Let B = the amount bet to you, i.e. the additional amount you'd need to put in if you want to call. So, if you bet 100 & your opponent with 800 left went all-in, B = 700. Let POT = the amount in the pot right now (including your opponent's bet). Let p = your probability of winning the hand if you call. So prob. of losing = 1-p. Let CHIPS = the number of chips you have right now. If you call, then E[your chips at end] = (CHIPS - B)(1-p) + (CHIPS + POT)(p) = CHIPS(1-p+p) - B(1-p) + POT(p) = CHIPS - B + Bp + POTp If you fold, then E[your chips at end] = CHIPS. You want your expected number of chips to be maximized, so it's worth calling if -B + Bp + POTp > 0, i.e. if p > B / (B+POT).

Example: "Poker Superstars Invitational Tournament", FSN, October Ted Forrest: 1 million chips Freddy Deeb: 825,000Blinds: 15,000 / 30,000 Cindy Violette: 650,000 Eli Elezra: 575,000(pot = 45,000) Elezra raises to 100,000 (pot = 145,000) Forrest folds. Deeb, the small blind with As 8h, folds. Violette, the big blind with Kd Jd, calls.(pot = 215,000) The flop is:2d 7c Ad Violette bets 100,000.(pot = 315,000) Elezra raises all-in to 475,000.(pot = 790,000) So, it's 375,000 more to Violette. She folds. Q: Based on expected value, should she have called? Her chances must be at least 375,000 / (790, ,000) = 32%.

Violette has K u J u. The flop is: 2 u 7  A u. Q: Based on expected value, should she have called? Her chances must be at least 375,000 / (790, ,000) = 32%. vs. AQ: 38%. AK: 37% AA: 26% 77: 26% A7: 31% A2: 34% 72: 34% TT: 54% T9: 87% 73: 50% Harrington's principle: always assume at least a 10% chance that opponent is bluffing. Bayesian approach: average all possibilities, weighting them by their likelihood. Maybe she's conservative.... but then why play the hand at all? Reality: Elezra had 7 u 3 . Her chances were 51%. Bad fold. What was her prob. of winning (given just her cards and Elezra’s, and the flop)? Of choose(45,2) = 990 combinations for the turn & river, how many give her the win? First, how many outs did she have? eight u s + 3 kings + 3 jacks = 14. She wins with (out, out) or (out, nonout) or (non- u Q, non- u T) choose(14,2) + 14 x * 3 = 534 but not (k or j, 7 or non- u 3) and not (3 u, 7 or non- u 3) - 6 * 4- 1 * 4 = 506. So the answer is 506 / 990 = 51.1%.

Yang / Kravchenko WSOP Main event Final table part 2 3/5 Yang A  10 u. Pot is 19million. Bet is 8.55 million. Needs P(win) > 8.55 ÷ ( ) = 31%. vs. AA: 8.5%. AJ-AK: 25-27%. KK-TT: 29% : 44-48%. KQs: 56%. Bayesian method: average these probabilities, weighting each by its likelihood.

Yang A  10 u. Pot is 19.0 million. Bet is 8.55 million. Suppose that P(Yang wins) = 30%. Suppose Yang calls. Let X = the number of chips Yang has after the hand. What is E(X)? [Note, if Yang folds, then X = 26 million for sure.] If Yang wins, he has 26 million + 19 million = 45 million. If Yang loses, he has 26 million million = million. E(X) = ∑ [b * P(X=b)] = [45 million * 30%] + [17.45 million * 70%] = million.