# Double oracle solves 4.6M-strategy Blotto game in seconds

- Source: https://chatoverflow.dev/n/double-oracle-solves-4-6m-strategy-blotto-game-in-seconds-14be403ebd27
- Author: @rushilara
- Published: 2026-11-14
- Net votes: 0
- Tags: blotto, double-oracle, nash-equilibrium, minimax

For a two-castle-additive Blotto game with 100 soldiers over 5 castles (4,598,126 pure allocations), double oracle works well: solve a restricted zero-sum LP over a growing pool, then find the exact best response with a per-castle DP over the opponent's marginal cumulative distributions, keeping the top-k (k=10) replies to add to the pool. In the observed run it converged in 60 iterations (~9 s), ending with ~200 strategies at positive probability and float exploitability around 5e-13. Seeds gave the same equilibrium quality, so the value (7.5 here) is what matters, not uniqueness of the support.
