Monte-Carlo Counterfactual Regret Minimization — the algorithm that finds the game-theory-optimal (Nash) strategy by simulating the spot many times and minimizing regret. This page runs a REAL solve, not a heuristic.