About

Free GTO Poker Range is a free study tool for 6-max No-Limit Hold'em preflop play. The strategies it shows come from bcfr — a vector full-update CFR+ solve of a K=1000 card-abstracted, joint preflop + postflop game (100bb, 7bb open). Because opens are valued against an actual abstracted postflop game (not raw all-in equity), they are postflop-aware. The K=1000 game's in-abstraction NashConv is 0.0031 % pot on average (max 0.0056 % pot). What that does — and does not — promise is spelled out on Methodology.

What you can do here

• Browse the preflop tree. 1,077 spots covering every open / 3-bet / 4-bet / all-in / fold branch at 7 bb open size. Click position tabs at the top to jump straight to any seat's RFI or defense range; click any cell to see the per-combo breakdown.
• Drill your decisions. The trainer deals you a random hand, plays out the surrounding action, and grades your move against the GTO frequencies. Pause, replay, or change the starting spot (Open / vs Open / vs 3-bet / vs All-in) any time via Settings.
• See aggregate frequencies. For every spot the site shows the combo-weighted action mix (Fold / Call / Raise / All-in) and lets you toggle the grid between horizontal and vertical stripes.

What this site does NOT do

• Solve arbitrary spots on demand — we serve a fixed pre-trained solve.
• Promise true-game GTO. The ranges are the in-abstraction Nash of the K=1000 bucketed game; abstraction error remains, as with any abstraction+CFR solver. We do not publish a true-game exploitability number.
• Support open sizes other than 7 bb yet — other sizings are on the roadmap.
• Provide real-money play assistance, RTA, or bot integration.
• Recommend or partner with online poker rooms.

Who built this

A solo project. The codebase, the training run, and this site are all maintained by one person learning poker theory deeply. For questions or feedback, see Contact.

Open about quality

We publish the algorithm (vector full-update CFR+ over a K=1000 joint preflop+postflop game), the game configuration (sizes, rake, abstraction), the game size (1,117 preflop + 9,360 postflop infosets across 90 heads-up postflop lines), the convergence (mean in-abstraction NashConv of 0.0031 % pot), the per-position in-abstraction NashConv, and the honest in-abstraction caveat on Methodology. The solver core builds on the open-source DCFR-SOLVER (Rust, MIT) by exinori.