Watch a poker solver compute itself
The "GTO" everyone talks about comes from an algorithm: CFR (Counterfactual Regret Minimization). It's the same one behind PioSolver and the bots that beat the pros (Libratus, Pluribus). It works by playing the game millions of times and, at each decision, measuring how much it "regrets" not doing something else — the average strategy converges to the Nash equilibrium.
Below it runs for real in your browser, on two toy poker games where it converges in seconds. Hit solve and watch it discover the bluff, the slowplay and when to fold — with no one teaching it.
Kuhn Poker
3 cartas (J<Q<K), una ronda. El juego mínimo donde ya existe el farol. El solver converge en una fracción de segundo.
Leduc Hold'em
6 cartas, dos rondas y una carta comunitaria. Ya tiene la maquinaria del poker real: calles, board, semi-faroles. Tarda un par de segundos (corre de verdad en tu navegador).
GTO preflop range (solved by us)
This isn't a copied range: our own ES-MCCFR solver computed it over the abstracted NLHE game (heads-up, 100bb) with 600k iterations. A single solve yields all three decisions — the open, the BB defense and the response to a 3-bet. Each cell blends the action colors by their GTO frequency.
With this bet-sizing abstraction (limp / 3× / all-in) the equilibrium mixes a lot of limp — expected in heads-up with a coarse betting menu. Refining the menu is the next step.
Live river solver
This is what makes the bots superhuman (Libratus, Pluribus): solving the subgame in real time. Nothing here is precomputed — when you hit it, our solver solves this exact river (board + ranges) in your browser and shows you the GTO strategy for every hand.
From Kuhn to a real-time river solver — EVolve's GTO engine, built in-house.