Solver Node

What is a Solver Node?

A solver node is a discrete point in a poker game tree where a solver program determines the optimal strategy (action frequencies) for a player under a given set of assumptions. Solvers use game theory optimal (GTO) principles to find equilibrium strategies, and the node represents a particular state: a specific board, pot size, stack depth, and action history. For example, a node could be "Hero bets 75% pot on the flop facing a check-raise" — the solver outputs how often to call, raise, or fold at that node.

How Solvers Work

Poker solvers like PioSOLVER or GTO+ build a game tree from user-defined parameters: ranges, bet sizes, board, and stack sizes. The tree branches at each decision (check, bet, raise, call, fold). Each branch leads to a new node. The solver then iterates (often using linear programming) to find a Nash equilibrium — a strategy profile where no player can improve their outcome by unilaterally deviating. The solution at each node is a set of frequencies: e.g., at a given node, the solver might say "check 40%, bet 60%" with specific hand classes.

Importance in Analysis

Players use solver nodes to study specific situations. By examining a node's output, they can understand how to adjust their own play towards GTO, or deviate exploitatively. Nodes also reveal which hands are indifferent (multiple actions with similar EV) and which are clear decisions. However, solver nodes assume perfect play from both sides and fixed bet sizes; they are tools for learning, not strict rules.

Example

Consider a flop of A♠ K♠ 7♥, with Hero in position. The solver node at "Hero bets 1/3 pot after checking" might output: call with 60% of range, raise with 10%, fold 30%. Within that, specific hands like flush draws raise at high frequencies, while weak pairs mostly call. This helps players internalize patterns.

Limitations

Nodes are only as good as the input assumptions. They ignore meta-game, opponent tendencies, and human error. Real play often requires simplifications (e.g., limiting bet sizes). Still, solver nodes provide a rigorous baseline strategy.

Related Concepts

• Game Tree: The complete map of possible actions and states in a hand.
• Equilibrium: The strategy found by the solver (Nash equilibrium).
• Range: The set of hands a player can hold at a given node.
• Frequency: The percentage of time each action is chosen at a node.
• Exploitability: How much a strategy deviates from equilibrium; nodes with high exploitability require careful play.