GTO Solver.
CFR+ solver, built in.
The embedded GTO Solver uses Counterfactual Regret Minimization (CFR+) to compute game-theory optimal strategies for any postflop scenario. You define the positions, stack sizes, board, and bet sizing tree — the solver handles the rest. Results are displayed on a 13x13 strategy grid showing action frequencies and EV for every combo. You can browse node-by-node through the game tree, lock specific nodes to model opponent tendencies, and configure custom action filters. The solver runs with parallel processing to deliver results faster, and exploitability tracking tells you when the solution has converged.
Why It Matters
- Solve any postflop scenario without external software or subscriptions
- Study solver outputs with a visual strategy grid and game tree browser
- Model opponent tendencies with node locking for exploitative analysis
- Run solves locally with parallel processing — no upload, no wait
Key Capabilities
CFR+ Engine
Full counterfactual regret minimization solver with configurable iterations and convergence tracking.
Custom Bet Sizing
Configure geometric, pot-fraction, or all-in bet sizing trees for any scenario.
Node Browsing
Navigate the game tree node-by-node. See action probabilities and EV for every combo at every decision point.
Node Locking
Freeze opponent ranges to model real-world tendencies and compute exploitative adjustments.
How to Use
Set up the scenario
Choose positions, stack sizes, and board cards for the spot you want to solve.
Configure bet sizing
Set the bet sizing tree — geometric, pot fractions, or custom sizes.
Run the solver
Click solve and watch exploitability decrease as CFR+ converges.
Browse the solution
Navigate the strategy grid and game tree to study the optimal play.