Nash Equilibrium Solver

In any competitive situation—like pricing a product against a competitor or playing poker—your best move depends on what you think *they* will do. But they are thinking the same thing about *you*. A 'Nash Equilibrium' is the stalemate where neither side can gain an advantage by changing their strategy alone. This tool simulates two players learning from each other over time until they reach that perfect, unbeatable balance point.

This solver uses the Fictitious Play iterative algorithm to approximate Nash Equilibrium in 2-player zero-sum games. It simulates thousands of rounds where each player updates their beliefs about the opponent's strategy based on historical play frequencies. The visualization tracks the convergence of strategy probabilities over time, demonstrating how rational agents settle into equilibrium even without explicit coordination.