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.

Slides:



Advertisements
Similar presentations
Advanced Strategies for Craps and Poker Billy J. Duke Joel A. Johnson.
Advertisements

Virtual Host: John Morales Revised: September 21, 2011 Project 4: Multi-media Lesson.
After the flop – nobody raised before the flop Strategy: No-Limit.
Lecture 13. Poker Two basic concepts: Poker is a game of skill, not luck. If you want to win at poker, – make sure you are very skilled at the game, and.
Tuomas Sandholm, Andrew Gilpin Lossless Abstraction of Imperfect Information Games Presentation : B 趙峻甫 B 蔡旻光 B 駱家淮 B 李政緯.
Short Stack Strategy – How to play after the flop Strategy: No Limit.
Lecture 10. Simplified roulette European roulette has numbers 0,1,…36. xD0s
Neural Networks for Opponent Modeling in Poker John Pym.
Dealer Comm Hand Player makes Ante bet and optional Bonus bet. Five cards are dealt to each player from the shuffler. Five cards are dealt from the shuffler.
BLACKJACK SHARKS: Aabida Mayet, Omar Bacerra, Eser Kaptan March 15, 2010.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 15 Chances, Probabilities, and Odds 15.1Random Experiments and.
Final Specification KwangMonarchIkhanJamesGraham.
Mathematics and the Game of Poker
Rene Plowden Joseph Libby. Improving the profit margin by optimizing the win ratio through the use of various strategies and algorithmic computations.
Poker for Fun and Profit (and intellectual challenge) Robert Holte Computing Science Dept. University of Alberta.
Intelligence for Games and Puzzles1 Poker: Opponent Modelling Early AI work on poker used simplified.
Texas Hold’em Poker Simulation Project Monarch ^ James Ikhan Kwang Graham Devin Organized by M^JIK Game Developers Members Include:
Intro to Probability & Games
Using Probabilistic Knowledge And Simulation To Play Poker (Darse Billings …) Presented by Brett Borghetti 7 Jan 2007.
Poki: The Poker Agent Greg Priebe Zak Knudson. Overview Texas Hold’em poker Architecture and Opponent Modeling of Poki Improvements from past Poki Betting.
Models of Strategic Deficiency and Poker Workflow Inference: What to do with One Example and no Semantics.
Introduction to the Big Stack Strategy (BSS) Strategy: No Limit.
Reinforcement Learning in the Presence of Hidden States Andrew Howard Andrew Arnold {ah679
Poker and AI How the most “stable” creature on earth got used to that good old game from the west!
Texas Holdem Poker With Q-Learning. First Round (pre-flop) PlayerOpponent.
Overview Odds Pot Odds Outs Probability to Hit an Out
Sonny Thomas Macdonald SONNY THOMAS MACDONALD 2010 Internet Computing Bsc.
Brain Teasers. Answer 3 Quantitative Finance Society Gambling Strategies & Statistics.
Introduction for Rotarians
NearOptimalGamblingAdive Matt Morgis Peter Chapman Mitch McCann Temple University.
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.
Artificial Intelligence in Games CA107 Topics in Computing Dr. David Sinclair School of Computer Applications
Poker Download A most popular card game or group of card games is called poker. Players compete against one another by betting on the values of each player's.
Blackjack: A Beatable Game Amber Guo Adapted from: David Parker Advisor: Dr. Wyels California Lutheran University ‘05.
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.
SARTRE: System Overview A Case-Based Agent for Two-Player Texas Hold'em Jonathan Rubin & Ian Watson University of Auckland Game AI Group
Quark Card Game by Helio Takai (and dice game)
Games, computers, and artificial intelligence NDHU CSIE AI Lab 羅仲耘.
Poker as a Testbed for Machine Intelligence Research By Darse Billings, Dennis Papp, Jonathan Schaeffer, Duane Szafron Presented By:- Debraj Manna Gada.
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.
Neural Network Implementation of Poker AI
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.Deal-making and expected value 2.Odds ratios, revisited 3.Variance.
The Poker Game in Jadex by Group 1 Mohammed Musavi (Ashkan) Xavi Dolcet Enric Tejedor.
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,
Artificial Neural Networks And Texas Hold’em ECE 539 Final Project December 19, 2003 Andy Schultz.
By: John Cook 11/06/2009 PTTE John Cook 3/4/2016.
The Mathematics of Poker– Implied Pot Odds Strategy: No-Limit.
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.Expected value. 2.Heads up with AA. 3.Heads up with Gus vs.
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
Lecture 13.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Lecture 11.
Lecture 10.
Stat 35b: Introduction to Probability with Applications to Poker
THE TEXAS HOLD’EM.
Strategies for Poker AI player
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:

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 –Pre-flop betting strategy –Basic betting strategy Reference

2004/11/04the challenge of poker3 Introduction Bridge and poker involve imperfect information Traditional methods like deep search can’t play these game well

2004/11/04the challenge of poker4 Texas Hold’em rules (1) 1. Opening deal – Each player is dealt two cards face down, which are known as hole cards or pocket cards. 2. First round of betting – Starting with the player to the left of the big blind, each player can call the big blind, raise, or fold. The big blind has the option to raise an otherwise unraised pot.

2004/11/04the challenge of poker5 Texas Hold’em rules (2) 3. The flop – The dealer burns a card, and then deals three community cards face up. The first three cards are referred to as the flop, while all of the community cards are collectively called the board.

2004/11/04the challenge of poker6 Texas Hold’em rules (3) 4. Second round of betting – Starting with the player to the left of the dealer button, each player can check or bet. Once a bet has been made, each player can raise, call, or fold.

2004/11/04the challenge of poker7 Texas Hold’em rules (4) 5. The turn – The dealer burns another card, and then adds a fourth card face-up to the community cards. This fourth card is known as the turn card, or fourth street.

2004/11/04the challenge of poker8 Texas Hold’em rules (5) 6. Third round of betting – It follows the same format as the second round, but the size of the bets have usually doubled in limit games.

2004/11/04the challenge of poker9 Texas Hold’em rules (6) 7. The river – The dealer burns another card, and then adds a fifth and final card to the community cards. This fifth card is known as the river card, or fifth street.

2004/11/04the challenge of poker10 Texas Hold’em rules (7) 8. Final round of betting – It follows the same format as the second and third rounds. 9. The showdown – Using the best five- card combination of their hole cards and the community cards, the remaining players show their hands, with the bettor or last raiser showing first. The highest five-card hand wins the pot. (In case of a tie, the pot is evenly split among the winning hands.)

2004/11/04the challenge of poker11 Poki’s architecture

2004/11/04the challenge of poker12 Pre-flop betting strategy(1) Income rate: base on roll simulation Roll simulation: an off-line computation that consists of playing several million hands (trials) where all players call the first bet, and then all the remaining cards are dealt out without any further betting David Sklansky wrote books on this game and classify the hand cards.

2004/11/04the challenge of poker13 Pre-flop betting strategy(2)

2004/11/04the challenge of poker14 Pre-flop betting strategy(3) Prefer roll-out simulation than David Sklansky’s classification –Roll-out simulation information is quantitative rather than qualitative –Can apply many difference specific situation

2004/11/04the challenge of poker15 Basic betting strategy(1) Hand strength (HS): is the probability that a given hand is better than that of an active opponent For example: hand is A ♦ -Q ♣ and the flop is J ♥ -4 ♣ -3 ♥.47 remaining unknown cards and therefore {47 choose 2} = 1081 possible hands an opponent might hold. 444 cases are better than hand, 9 are equal, and 628 are worse than hand. There is a 58.5% chance that hand is better than a random hand. If there are 5 opponents, the HS 5 is = 6.9%

2004/11/04the challenge of poker16 Basic betting strategy(2) Hand potential –Positive potential (PPot): Chance that a hand which is not currently the best improves to win at the showdown –Negative potential (NPot): Chance that a currently leading hand ends up losing All possible opponent cards is {47 choose 2} = 1081, therefore remains {45 choose 2} = 990 possible turn and river cards to consider for each opponent

2004/11/04the challenge of poker17 Basic betting strategy(3) For example: if the hand A ♦ -Q ♣ is ahead against one opponent after 5 cards, then after 7 cards there is a / = 72% chance of still being ahead

2004/11/04the challenge of poker18 Basic betting strategy(4) Effective hand strength (EHS): combines hand strength and potential to give a single measure of the relative strength of Poki’s hand against an opponent P(win) = P(ahead) x P(opponent does not improve) + P(behind) x P(we improve) = HS x (1 - NPot) + (1 - HS) x PPot

2004/11/04the challenge of poker19 Basic betting strategy(5) Weighting the enumerations –The probability of each hand being played to a particular point in the game will very –For example: the probability that the opponent holds Ace-King is much higher than 7-2 after the flop, because most will fold 7-2 before the flop

2004/11/04the challenge of poker20 Basic betting strategy(6) To account for this, Poki maintains a weight table for each opponent The weights have a value in the range zero to one

2004/11/04the challenge of poker21 Basic betting strategy(7) For example: [ A ♠ K ♣, 0.40 ],…[ Q ♦ 2 ♦, 0.20 ],… the PredictOpponentAction procedure generates probability distributions { P( fold), P( check / call), P( bet / raise)} A ♠ - K ♣ { 0.0, 0.7, 0.3 } Q ♦ - 2 ♦ { 0.0, 0.1, 0.9 } If the observed player action is a bet, after reweighting, the new table entry for A ♠ - K ♣ will be 0.4 x 0.3 = 0.12 Q ♦ - 2 ♦ will be 0.2 x 0.9 = 0.18

2004/11/04the challenge of poker22 Basic betting strategy(8) Probability triple PT = {f, c, r}, such that f + c + r = 1.0, representing the probability distribution that the next betting action in a given context is fold, call, or raise, respectively

2004/11/04the challenge of poker23 Reference The challenge of Poker / Darse Billings, Aaron Davidson, Jonathan Schaeffer, Duane Szafron / Artificial Intelligence 134 (2002)

2004/11/04the challenge of poker24 Thanks for your attention!