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.
game rust reinforcement-learning ai poker card-game isomorphism kmeans kmeans-clustering optimal-transport texas-holdem earth-movers-distance cfr counterfactual-regret-minimization nlhe pluribus poker-solver counterfactual-regret
-
Updated
Dec 3, 2024 - Rust