6-max NLHE poker bot on Deep CFR. MCCFR-trained, pure-NumPy runtime, 2s/768MB sandbox. 12th of 500+, 15th of 64 in the final, Fullhouse Hackathon 2026 (Quadrature Capital).
-
Updated
Aug 5, 2026 - Python
6-max NLHE poker bot on Deep CFR. MCCFR-trained, pure-NumPy runtime, 2s/768MB sandbox. 12th of 500+, 15th of 64 in the final, Fullhouse Hackathon 2026 (Quadrature Capital).
High-throughput reinforcement-learning search and sampling in Rust, with caller-owned Python networks and training
Heads-up no-limit Texas Hold'em research stack with exact Python/C++ engines, Deep CFR training, evaluation, search, and a desktop GUI.
Research prototype for 6-max poker AI systems using Rust, Deep-CFR-style training, PyTorch, ONNX, and controlled simulator evaluation.
Implementation of AI Poker HULH with Deep CFR and MCCFR ES as thesis for Bachelor of Engineering degree
Open-source GTO poker solver with neural network strategy approximation and 75ms real-time search decisions. Built for study, research, and extension.AI built in five stages: CFR, card abstraction, Deep CFR, and real-time search. Readable code, full docs, 27 tests.
A 6-max No-Limit Texas Hold'em AI lab: full poker engine, five paradigms (rule-based, Monte Carlo, tabular CFR, Deep CFR, Q-learning), reproducible training pipelines, a 100k-hand benchmark, and a 28-page paper on the math behind them.
Deep CFR, offline RL (CQL/IQL) and self-play evaluation for 6-max No-Limit Hold'em in PyTorch
Game-theory and RL agents measured against exact optima: CFR+, Deep CFR and DQN across six games, with a live in-browser console.
B.Sc. Mathematics Thesis: Theoretical & empirical variance reduction analysis in Deep Counterfactual Regret Minimization (OpenSpiel).
Game-theory solver for heads-up pot-limit Drawmaha, built as a validation ladder: regret matching → CFR on Kuhn and Leduc → MCCFR and Deep CFR on mini-drawmaha, each rung graded by an exact best response.
To associate your repository with the deep-cfr topic, visit your repo's landing page and select "manage topics."