Poker as a Testbed for Machine Intelligence Research By Darse Billings, Dennis Papp, Jonathan Schaeffer, Duane Szafron Presented By:- Debraj Manna Gada.

Slides:



Advertisements
Similar presentations
Advanced strategies for postflop play Strategy: SnG / tournaments.
Advertisements

Advanced Strategies for Craps and Poker Billy J. Duke Joel A. Johnson.
How to win at poker using game theory A review of the key papers in this field.
After the flop – an opponent raised before the flop Strategy: No-Limit.
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.
Randomized Strategies and Temporal Difference Learning in Poker Michael Oder April 4, 2002 Advisor: Dr. David Mutchler.
Managerial Decision Modeling with Spreadsheets
No-Regret Algorithms for Online Convex Programs Geoffrey J. Gordon Carnegie Mellon University Presented by Nicolas Chapados 21 February 2007.
Neural Networks for Opponent Modeling in Poker John Pym.
Rational Agents for the Card Game “BS” Jeff Reilly, Brian Munce, Stephen Tanguis, Alex Keeler.
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.
Intro to Probability & Games
Using Probabilistic Knowledge And Simulation To Play Poker (Darse Billings …) Presented by Brett Borghetti 7 Jan 2007.
Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker * Andrew Gilpin and Tuomas Sandholm, CMU,
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
Undergrad probability course (not a poker strategy guide nor an endorsement of gambling). Standard undergrad topics + random walks, arcsine laws, and a.
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.
Introduction Many decision making problems in real life
Artificial Intelligence in Games CA107 Topics in Computing Dr. David Sinclair School of Computer Applications
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 6 –Adversarial Search Thursday –AIMA, Ch. 6 –More Adversarial Search The “Luke.
SARTRE: System Overview A Case-Based Agent for Two-Player Texas Hold'em Jonathan Rubin & Ian Watson University of Auckland Game AI Group
Games, computers, and artificial intelligence NDHU CSIE AI Lab 羅仲耘.
Memory and Analogy in Game-Playing Agents Jonathan Rubin & Ian Watson University of Auckland Game AI Group
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.
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.
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
Neural Network Implementation of Poker AI
DEEP RED An Intelligent Approach to Chinese Checkers.
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.
Short stack strategy: Draws in a free play situation Strategy: No Limit.
All In To put all the rest of your money into the pot.
GamblingGambling What are the odds? Jessica Judd.
Introduction to Poker Originally created by Albert Wu,
Penn Poker Fall Strategy Session Series
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.
Artificial Intelligence AIMA §5: Adversarial Search
Lecture 13.
Stochastic tree search and stochastic games
Game Theory Just last week:
Strategies for Poker AI player
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Factor Game Sample Game.
Stat 35b: Introduction to Probability with Applications to Poker
HOW TO PLAY POKER.
Presentation transcript:

Poker as a Testbed for Machine Intelligence Research By Darse Billings, Dennis Papp, Jonathan Schaeffer, Duane Szafron Presented By:- Debraj Manna Gada Kekin Dhiraj Raunak Pillani

CONTENT Introduction  Characteristics of Poker Game  Texas Hold’Em  Requirements From Players  Lokibot  Experiment  Future Work

INTRODUCTION Game Researchers used Chess & other board games as TestBed Poker can be a better testbed for decision making problems

POKER Game of Imperfect knowledge  Risk management  Agent modelling  Unreliable information  Deception Heuristic Search and evaluation methods employed in Chess not helpful.

AI PROBLEM CHARACTERISTICS

TEXAS HOLD 'EM Pre-Flop – Each player is dealt with two cards with their face down Community Cards are dealt in 3 stages:-  Flop – 3 cards are dealt with face up  Turn – 4 th community card is dealt with face up.  River – last community card is dealt A round of betting held at each stage Showdown – player having the best 5 cards wins the game

BETTING STRATEGY FOLD – Withdraw from the game CALL – Match the current bet RAISE – Raise the current outstanding bet Only 3 raises are allowed in a round.

REQUIREMENT Hand Strength – strength of your hand compared to opponents. Hand Potential – Probability of hand improving as additional cards appear. Betting Strategy – Determining optimal betting strategy Bluffing – Allows you make profit even on weak hands

REQUIREMENT (contd.)‏ Opponent Modeling – Determining probability distribution for opponents strategy. Unpredictability – making difficult for opponent to model your strategy.

Lokibot (later changed to Pokibot)‏

Pre-flop Evaluation 52 choose 2 = 1326 possible combinations for two cards Approximate income rate for each starting hand using a simulation of 1,000,000 poker games done against nine random opponents  Highest income rate: A pair of aces  Lowest income rate: 2 and 7 (of different suits)‏ One time evaluation

Hand Evaluation 1.Hand Strength Assessment of the current strength of the hand Enumeration techniques can provide an accurate estimate of the probability of currently holding the strongest hand. 2.Hand Potential Potential changes in hand strength

Hand Strength Starting hand is and the flop is 47 remaining unknown cards and {47 choose 2} = 1,081 possible hands an opponent might hold. Hand strength is estimated by simply counting number of possible hands that are:  better than ours (any pair, two pair, A-K, or three of a kind: 444 hands)  equal to ours (9 possible remaining A-Q combinations)  worse than ours (628)‏

Hand Potential Hand strength alone is insufficient to assess the quality of a hand Example  Hand:  Flop:  Next card:, Positive / Negative Potential

Hand Potential (contd.)‏

If T{row,col} refers to the values in the table (B, T, A, and S are Behind, Tied, Ahead, and Sum, resp.) then Ppot and Npot are calculated by: Ppot = (T{B,A} + T{B,T}/2 + T{T,A}/2 ) / ( T{B,S} + T{T,S}/2)‏ Npot = (T{A,B} + T{A,T}/2 + T{T,B}/2 ) / ( T{A,S} + T{T,S}/2)‏ Ppot = and Npot = 0.274

Betting Strategy Hand strength and potential are combined into effective hand strength (EHS): EHS = HSn + (1 - HSn ) x Ppot where HSn is the adjusted hand strength for n opponents, Ppot is the positive potential. EHS is the probability that we are ahead, and in those cases where we are behind there is a Ppot chance that we will pull ahead pot_odds = bets_to_us / ( bets_in_pot + bets_to_us )‏ Call when Ppot > pot_odds

Player A is the most advanced version of the program Player E is a basic player Player B lacks an appropriate weighting of subcases, using a uniform distribution for all possible opponent hands. Player C uses a simplistic pre-flop hand selection method, rather than the advanced system which accounts for player position and number of opponents. Player D lacks the computation of hand potential, which is used in modifying the effective hand strength and calling with proper pot odds. Experiment

Experiment (contd.)‏

The Bot was also run against other Poker playing bots and human players over the internet. In it's current state the bot showed losses against advanced players

Work In Progress It is a predictable player that reacts the same in a given situation irrespective of any historical information Opponent modeling: When Lokibot is better able to infer likely holdings for the opponent, it will be capable of much better decisions Betting strategy: bluff with high potential hands and occasionally bet a strong hand weakly

Work Done After The Paper Later versions used simulation to discover the correct action to take, simulating what the actions of the other players (estimated using the opponent modelling) would be depending on the action that Lokibot chose. They included selective sampling simulation: Opponent modelling consisted of weights for each hole card combination describing the probabilities of each action (bet, call, fold) and they measured opponents by their rate of each action. The most recent work has concerned other approaches to poker game-tree search methods, as well as ways to evaluate perfomance of agents

Contributions Of This Paper Showing that poker can be a testbed of real- world decision making, Identifying the major requirements of high- performance poker, Presenting new enumeration techniques for hand-strength and potential, and Demonstrating a working program that successfully plays "real" poker.

REFERENCE Billings D., Papp D., Schaeffer J. and Szafron D. "Poker as a Testbed for Machine Intelligence Research." In Advances in Artificial Intelligence (Mercer R. and Neufeld E. eds.), Springer-Verlag, pp 1-15,