View the chart for any spot. Compare two of them to see what opens up or tightens as the stack depth or the seat changes.
Computed here · approximatePush/fold equilibrium (computed here)v1.0.0
Not a transcription of a published Nash table, but a numerical solution to a simplified model inside this repository. The matrix itself is (largest gap against published values: 0.26%), and the simplifications below (no , s not -dependent) move it further from a true .
Assumes an : everyone before the hero has folded
Applies from 1 to 25. Deeper than that you need options other than , which this chart cannot judge
The hero may only . Middling raise sizes are not modelled
Players behind act in order and the hand ends at the first call ( calls are not modelled)
Calling s are solved separately for each (caller, r) pair
A further from a seat behind the caller is not modelled
Chip only. is not applied ( decisions are handled separately in M5)
Everyone is assumed to have the same as the hero
Antes use the big-blind format: one player posts for the table
Computed here: Built a head-to-head equity table for all 169 hands (seeded Monte Carlo, 30,000 runs per pairing, averaged with the mirrored value to smooth out noise), then solved the all-in-or-fold subgame numerically over 2,000 iterations of fictitious play. Card removal is counted exactly, not approximated.