Neural Networks for Opponent Modeling in Poker John Pym.

Slides:



Advertisements
Similar presentations
Bet sizing – How much to bet and why? Strategy: SnG / Tournaments.
Advertisements

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.
Final Specification KwangMonarchIkhanJamesGraham.
Mathematics and the Game of Poker
Tetris AI 팀원 김유섭 ( ) 류동균 ( ) 임성훈 ( )
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.
DNA Starts to Learn Poker David Harlan Wood 4 * Hong Bi 1 Steven O. Kimbrough 2 Dongjun Wu 3 Junghuei Chen 1* Departments of 1 Chemistry & Biochemistry.
Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker Andrew Gilpin and Tuomas Sandholm Carnegie.
A competitive Texas Hold’em poker player via automated abstraction and real-time equilibrium computation Andrew Gilpin and Tuomas Sandholm Carnegie Mellon.
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,
Computer Programming.  Analysis  User requirements  Feasibility and costs  Success criteria  Design and Planning  Classes  Data structures and.
Jerad Hobgood.  24/7 Accessibility  Fast Games  No tipping  No travel  Find table in your price range  Play in more than one table at a time.
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
Computer Programming My Home Page My Paper Job Description Computer programmers write, test, and maintain the detailed instructions, called programs,
Texas Holdem Poker With Q-Learning. First Round (pre-flop) PlayerOpponent.
Online Poker James Gilman. Topics ●Hand Probabilities ●Betting Odds ●Odds of winning ●Expected Value ●Decision Making ●Poker Statistics ●Variance.
Using Bayesian Networks for Detecting Network Anomalies Lane Thames ECE 8833 Intelligent Systems.
Advanced Artificial Intelligence Lecture 3B: Game theory.
EGGG: Automated programming for game generation J. ORWANT PRESENTED BY HANFENG CHEN MARCH 25, 2015.
Sonny Thomas Macdonald SONNY THOMAS MACDONALD 2010 Internet Computing Bsc.
NearOptimalGamblingAdive Matt Morgis Peter Chapman Mitch McCann Temple University.
Introduction Many decision making problems in real life
ECE Grande ECE 477 Design Review Team 3 - Fall 2008.
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.
Applying Neural Networks to Day-to-Day Stock Prediction by Thomas Eskebaek.
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)
Application of Artificial Intelligence to Chess Playing Jason Cook Capstone Project.
CSC Intro. to Computing Lecture 22: Artificial Intelligence.
I Robot.
CHECKERS: TD(Λ) LEARNING APPLIED FOR DETERMINISTIC GAME Presented By: Presented To: Amna Khan Mis Saleha Raza.
Jump to first page Applications of Artificial Intelligence Mike Scavezze March 28, 2000.
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.
Yikan Chen Weikeng Qin 1.
The course. Description Computer systems programming using the C language – And possibly a little C++ Translation of C into assembly language Introduction.
Neural Network Implementation of Poker AI
Gambling Because why not?. Blackjack and card counting Card counting is a casino card game strategy used primarily in the blackjack family of casino games.
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.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Better automated abstraction techniques for imperfect information games Andrew Gilpin and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
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.
Texas Hold-em Math 7 Chapter 1 Test Review. How to play Each group of 2 will get 2 cards (face-down) Dealer will deal (face-up) cards for the groups to.
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 Neural Networks This is lecture 15 of the module `Biologically Inspired Computing’ An introduction to Artificial Neural Networks.
By: Jordan Simon Mike Norman Charles Slack
Game Theory Just last week:
Strategies for Poker AI player
ECE 477 Digital Systems Senior Design Project  Fall 2008
إستراتيجيات ونماذج التقويم
ECE 477 Final Presentation Team 3 – Fall 2008
Stat 35b: Introduction to Probability with Applications to Poker
Gain an advantage by knowing yourself and your opponents
Stat 35b: Introduction to Probability with Applications to Poker
HOW TO PLAY POKER.
Presentation transcript:

Neural Networks for Opponent Modeling in Poker John Pym

Introduction Texas Hold’em poker Texas Hold’em poker –2 down cards, followed by a round of betting. –5 community cards, 3 more rounds of betting. Imperfect information Imperfect information –Correct strategy depends on opponent’s hand Goal: Implement a neural network predictor of an opponent’s hand Goal: Implement a neural network predictor of an opponent’s hand

Code I used University of Alberta’s Computer Poker Research Group ( University of Alberta’s Computer Poker Research Group ( –Java source code for hand evaluation, other miscellaneous routines. –Predictor.java – interface for action predictor system –Context.java – class containing context information

Code I used Fast Artificial Neural Network Library (fann.sourceforge.net) Fast Artificial Neural Network Library (fann.sourceforge.net) –Open source neural network library written in C –Linked into Java program using System.load() IRC poker database (games.cs.ualberta.ca/poker/IRC/) IRC poker database (games.cs.ualberta.ca/poker/IRC/) –History of 10 million hands played between 1995 and 2001 on the IRC poker server

Steps Finding the probability distribution for hole card combinations. Finding the probability distribution for hole card combinations. –Predictor finds probability of raise/call/fold given a context. –We want a probability distribution of hole card combinations. –Used Bayesian logic to find these probabilities, given a predictor and partial context.

Steps Implemented a neural network predictor Implemented a neural network predictor –Inputs: 22 context variables (hand strength, pot odds, number of players in hand, etc). –Output: prediction of raise/call/fold for a hand. –This is used to obtain a probability distribution for an opponent’s hole cards.