Zealoter / CFVFPLinks
This repository is the accompanying code for the paper CFVFP. This paper presents a new algorithm for solving incomplete information games - CFVFP, which has better results than MCCFR in some games. The paper has been accepted by NeurIPS 2024.
☆14Updated 11 months ago
Alternatives and similar repositories for CFVFP
Users that are interested in CFVFP are comparing it to the libraries listed below
Sorting:
- Framework for Multi-Agent Deep Reinforcement Learning in Poker☆506Updated 2 years ago
- ☆75Updated 2 years ago
- Implementations of CFR for solving a variety of Holdem-like poker games☆166Updated 2 years ago
- Scalable Implementation of Deep CFR and Single Deep CFR☆314Updated 5 years ago
- Python implementation of Deepstack☆87Updated 6 years ago
- C++ implementations of Counterfactual Regret Minimization and Monte Carlo CFR☆75Updated 3 years ago
- Python library for solving Extensive-form Games and implementation of various baseline algorithms (e.g., CFR, CFR+, PCFR, DOMD)☆35Updated last year
- An unoffical implementation of AlphaHoldem. 1v1 nl-holdem AI.☆107Updated 2 years ago
- ☆28Updated 4 years ago
- ☆24Updated 3 years ago
- ☆221Updated 7 years ago
- This code is based on the implementation of http://www.cs.cmu.edu/afs/cs/Web/People/sandholm/potential-aware_imperfect-recall.aaai14.pdf,…☆35Updated 7 years ago
- A NLTH Poker Agent using Counterfactual Regret Minimization☆51Updated 6 years ago
- An attempt at a Python implementation of Pluribus, a No-Limits Hold'em Poker Bot☆107Updated 5 years ago
- Implementation of Pluribus by Noam Brown & Tuomas Sandholm, a Superhuman AI for 6-MAX No-Limit Holdem Poker Bot.