Poki: The Poker Agent Greg Priebe Zak Knudson. Overview Texas Hold’em poker Architecture and Opponent Modeling of Poki Improvements from past Poki Betting.

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.
Probability and Casino Games
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.
ChooseMove=16  19 V =30 points. LegalMoves= 16  19, or SimulateMove = 11  15, or …. 16  19,
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.
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.
Honte, a Go-Playing Program Using Neural Nets Frederik Dahl.
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.
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.
Quark Card Game by Helio Takai (and dice game)
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
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)
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
Learning BlackJack with ANN (Aritificial Neural Network) Ip Kei Sam ID:
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.
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)
The Elements. The Cards 地 : Earth 水 : Water 火 : Fire 風 : Air 空 : Void/Spirit.
Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.
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.
Poker as a Testbed for Machine Intelligence Research By Darse Billings, Dennis Papp, Jonathan Schaeffer, Duane Szafron Presented By:- Debraj Manna Gada.
Neural Network Implementation of Poker AI
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.
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,
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.
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.
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.
JokerStars: Online Card Playing William Sanville Milestone 5.
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
Game Theory Just last week:
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
THE TEXAS HOLD’EM.
Strategies for Poker AI player
Probability of casino games
Stat 35b: Introduction to Probability with Applications to Poker
Term Project: Poker Game
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:

Poki: The Poker Agent Greg Priebe Zak Knudson

Overview Texas Hold’em poker Architecture and Opponent Modeling of Poki Improvements from past Poki Betting strategies w/ analysis of hand strengths, weighting, and probabilities.

Texas Hold’em Each player gets 2 “hole” cards Community cards: –3 “flop” cards –1 “turn” card –1 “river” card Rounds of betting after each set of cards

Poki Program Architecture

Opponent Modeling Weight table No modeling Generic opponent modeling Specific opponent modeling

The Old Way Specific opponent modeling Betting frequency table –Keeps track of actions taken in different contexts –Predicts median hand strength Left out many relevant details

New and Improved Specific opponent modeling Detailed Dynamic learning/adaptation Prelim. Neural net study

Poki’s Neural Net

Some Results Training Data Results from percent Confusion matrix Error prone?

In Field Predictions #holdem1: 24% increase

In Field Performance

Small Bets Won Pro: Old opponent modeling:.09 New opponent modeling:.22

Betting Strategy Pre-flop and Post-flop strategies are significantly different. -Pre: little information available to influence the betting decision. -Post: uses opponent models, private hand, and game context to generate an action.

Pre-flop Betting Strategy * - pocket pair hand (two cards of the same rank) s - suited hand o - offsuit hand

Post-flop: Basic Betting Strategy Compute Poki’s effective hand strength (EHS). Using the game context, betting rules, and formulas to translate the EHS into a probability triple { Pr(fold), Pr(call), Pr(raise) }. Generate a random number and use it to choose an action from the probability distribution.

Hand Strength Probability that a given hand is better than that of an active opponent.

Hand Potential With 2 cards yet to be revealed, we want to know the impact. Positive potential (Ppot) – chance hand improves to win. Negative potential (Npot) – chance hand ends up losing. Calculated by enumerating over all possible hole cards, and over all possible board cards. This is an expensive process.

Hand potential example

Effective Hand Strength Combines hand strength and potential to give Poki’s own relative strength against an opponent. Pr(win) = pr(ahead) * pr(opp doesn’t improve) + Pr(behind) * pr(we improve) = HS * (1 – Npot) + (1 – HS) * Ppot

Weighting the Enumerations Probability of hands played to a particular point will vary. To account for this, Poki maintains a weight table for each opponent.

Conclusions Need opponent modeling Complex system Betting strategies and determining hand strength Reweight helps to determine opponents likely action