zanussbaum/pluribus

An attempt at a Python implementation of Pluribus, a No-Limits Hold'em Poker Bot

35
/ 100
Emerging

This project helps you explore and understand strategies for playing poker variants, specifically Kuhn Poker and Leduc Hold'em. It takes in the rules of these simplified poker games and outputs optimal playing strategies based on Monte Carlo Counterfactual Regret Minimization and Depth Limited Search. This is useful for researchers in game theory or AI, or anyone interested in developing advanced poker AI.

106 stars. No commits in the last 6 months.

Use this if you are developing or studying AI agents for simplified poker games and need a robust implementation of game theory algorithms like MCCFR and Depth Limited Search.

Not ideal if you are looking for a complete, production-ready bot for playing No-Limit 6-player Hold'em, as this focuses on simplified variants and core algorithms.

poker-AI game-theory multiplayer-agents strategic-decision-making AI-research
No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 9 / 25
Maturity 8 / 25
Community 18 / 25

How are scores calculated?

Stars

106

Forks

19

Language

Python

License

Category

card-game-ai

Last pushed

Oct 15, 2020

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/zanussbaum/pluribus"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.