Play, learn, solve, and analyze No-Limit Texas Hold Em. Implementation follows from Monte Carlo counter-factual regret minimization over with hierarchical K-means imperfect recall abstractions.
-
Updated
Nov 16, 2024 - Rust
Play, learn, solve, and analyze No-Limit Texas Hold Em. Implementation follows from Monte Carlo counter-factual regret minimization over with hierarchical K-means imperfect recall abstractions.
River Nash equilibrium solver with bet size solving functionality
A simplified solver written for Heads Up No-Limit Hold'Em Poker, written for my CS238 final.
Add a description, image, and links to the poker-solver topic page so that developers can more easily learn about it.
To associate your repository with the poker-solver topic, visit your repo's landing page and select "manage topics."