ChengTsang / Potential-Aware-Abstraction-In-Texas-Hold-em-Poker
This code is based on the implementation of http://www.cs.cmu.edu/afs/cs/Web/People/sandholm/potential-aware_imperfect-recall.aaai14.pdf, you can read it to understand its details.
☆34Updated 6 years ago
Alternatives and similar repositories for Potential-Aware-Abstraction-In-Texas-Hold-em-Poker:
Users that are interested in Potential-Aware-Abstraction-In-Texas-Hold-em-Poker are comparing it to the libraries listed below
- A NLTH Poker Agent using Counterfactual Regret Minimization☆51Updated 5 years ago
- Python implementation of Deepstack☆83Updated 5 years ago
- Potential-Aware Imperfect-Recall Abstraction with Earth Mover’s Distance in Imperfect-Information Games☆16Updated 6 years ago
- Implementations of CFR for solving a variety of Holdem-like poker games☆150Updated last year
- ☆70Updated 10 months ago
- An attempt at a Python implementation of Pluribus, a No-Limits Hold'em Poker Bot☆102Updated 4 years ago
- k-means clustering for poker hands based on earth mover's distance (EMD)☆15Updated 5 years ago
- poker ai☆30Updated 3 years ago
- Counterfactual regret minimization algorithm for Kuhn poker☆171Updated 6 years ago
- ☆17Updated 5 years ago
- Scalable Implementation of Deep CFR and Single Deep CFR☆294Updated 4 years ago
- Scalable Implementation of Neural Fictitous Self-Play☆77Updated 6 years ago
- ☆216Updated 6 years ago
- Using counter factual regret minimization to computer optimal ranges of hands for each decision☆48Updated 4 years ago
- An open implementation of Pure CFR applied to ACPC poker games.☆205Updated 8 years ago
- ☆71Updated last year
- A C library for indexing poker hands that respects suit isomorphisms☆68Updated 10 years ago
- This is an implementation of DeepStack for No Limit Texas Hold'em, extended from DeepStack-Leduc.☆26Updated 5 years ago
- ☆30Updated 6 years ago
- C++ implementations of Counterfactual Regret Minimization and Monte Carlo CFR☆74Updated 2 years ago
- Counterfactual Regret Minimization☆29Updated 7 years ago
- Monte Carlo Conterfactual Regret Minimization for imperfect information games☆13Updated 6 years ago
- Implementation of Pluribus by Noam Brown & Tuomas Sandholm, a Superhuman AI for 6-MAX No-Limit Holdem Poker Bot.☆230Updated 3 years ago
- OpenAI Gym No Limit Texas Hold 'em Environment for Reinforcement Learning☆162Updated 5 years ago
- Parsing the hand histories that poker AI Pluribus played☆78Updated 5 years ago
- ☆33Updated 5 years ago
- ☆28Updated 3 years ago
- Collection of game-theoretic algorithms for Poker☆29Updated 6 years ago
- Framework for Multi-Agent Deep Reinforcement Learning in Poker☆457Updated 2 years ago
- A python implementation of Counterfactual Regret Minimization for poker☆285Updated 10 years ago