Yikan Chen Weikeng Qin 1.

Slides:



Advertisements
Similar presentations
How to win at poker using game theory A review of the key papers in this field.
Advertisements

Biologically Inspired Computing: Operators for Evolutionary Algorithms
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Randomized Strategies and Temporal Difference Learning in Poker Michael Oder April 4, 2002 Advisor: Dr. David Mutchler.
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Neural Networks for Opponent Modeling in Poker John Pym.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
DAN SHMIDT ITAY BITTAN Advanced Topics in Evolutionary Algorithms.
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.
Applying Genetic Programming to Stratego Ryan Albarelli.
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,
Neural Optimization of Evolutionary Algorithm Strategy Parameters Hiral Patel.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
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.
Online Poker James Gilman. Topics ●Hand Probabilities ●Betting Odds ●Odds of winning ●Expected Value ●Decision Making ●Poker Statistics ●Variance.
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Introduction for Rotarians
NearOptimalGamblingAdive Matt Morgis Peter Chapman Mitch McCann Temple University.
More precisely called Branch of AI behind it.
C. Benatti, 3/15/2012, Slide 1 GA/ICA Workshop Carla Benatti 3/15/2012.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Learning BlackJack with ANN (Aritificial Neural Network) Ip Kei Sam ID:
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
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.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
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.
Mike Taks Bram van de Klundert. About Published 2005 Cited 286 times Kenneth O. Stanley Associate Professor at University of Central Florida Risto Miikkulainen.
ELeaRNT: Evolutionary Learning of Rich Neural Network Topologies Authors: Slobodan Miletic 3078/2010 Nikola Jovanovic 3077/2010
1 Genetic Algorithms and Ant Colony Optimisation.
Blondie24 Presented by Adam Duffy and Josh Hill. Overview Introduction to new concepts Design of Blondie24 Testing and results Other approaches to checkers.
Neural Network Implementation of Poker AI
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
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.
1 DNA starts to Learn Poker David Harlan Wood Hong Bi Steven O.Kimbrough Dongjun Wu Junghuei Chen.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Pac-Man AI using GA. Why Machine Learning in Video Games? Better player experience Agents can adapt to player Increased variety of agent behaviors Ever-changing.
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.
Iterated Prisoner’s Dilemma Game in Evolutionary Computation Seung-Ryong Yang.
Introduction to Poker Originally created by Albert Wu,
The Mathematics of Poker– Implied Pot Odds Strategy: No-Limit.
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
Outline: 1) Odds ratios, continued. 2) Expected value revisited, Harrington’s strategy 3) Pot odds 4) Examples.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
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.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
By: Jordan Simon Mike Norman Charles Slack
Game Theory Just last week:
Strategies for Poker AI player
THe University of Georgia Genetic Algorithm BOT
Introduction to Genetic Algorithm and Some Experience Sharing
HOW TO PLAY POKER.
Presentation transcript:

Yikan Chen Weikeng Qin 1

2 Evolutionary Algorithm Poker!

3

 Evolution Process 4 Crossover Mutation Natural Selection  Evolutionary Algorithm

 Encoding and Crossover

 Mutation

 Natural Selection 7 Run the roulette-wheel selection based on the fitness value of candidates

 Important Parameters  Crossover rate  Mutation rate  Elite rate  Fitness function  Demo 8

 AKQ 2-player game  $1 blinds for each player  Player1 bet or fold  Player2 call or fold 9

 Derive the optimal strategy using EA  Chromosomal representations  Fij: fold threshold when Pi got Cardj  Fitness functions 10 Card1Card2Card3 P12/300 P212/30

 Fitness functions  Fi: fitness function  Wij: money won by candidate I against candidate j 11

12

13

14  Decreased fluctuation  Further decreased fluctuation generations Var(f11) ; Var(f22) Mean(f11); Mean(f22) Count only wins.065; ;.60 Penalize failure.037; ;.70 Penalize Failure heavier.028; ;.74

 Real Texas Hold’em  Encoding Strategy (Turn and River)  Hand strength (player confidence)  Fraction of opponent raise (opponent confidence)  Total raise (profit) 15

 Fitness Criterion 16

 Performance 17

18

19 ∑ ∑ w1w1 w2w2 wnwn b …… a1a1 a2a2 anan 1 f f output

20 Input output Hidden Layer

 Simplest Encoding Method 21 a a b b c c d d d d c c b b a a

  Neuro Evolution of Augmenting Topologies  Encoding Strategy: Node-based  Neuron gene table  Link gene table  Innovation number  Global database of innovations  Each innovation has unique ID number 22

23

 Mutation  Perturb weights  Add a link gene  Add a neuron gene  Crossover  By innovation number 24

 Crossover >4 2 2->4 3 3->4 4 2->5 5 5->4 8 1->5 1 1->4 2 2->4 3 3->4 4 2->5 5 5->4 6 5->6 7 6->4 9 3> >6

 Crossover >5 1 1->4 2 2->4 3 3->4 4 2->5 5 5->4 6 5->6 7 6->4 9 3> >6

 Simplified Poker Model  1-10  Initial credit: 10 chips  One chip ante at the beginning  Call, raise (1 chip each time), fold  Tournament 27

28 Two player game

29

 Four different types of opponents 30 Tight Aggressive (TA)Tight Passive (TP) Loose Aggressive (LP)Loose Passive (LP)

 α: min win probability to call  β: min win probability to raise 31

32 A: player type B: player action

33

 Bluffing…… 34

35 Thanks!