Colonel Blotto

Imagine two commanders, each with a fixed army of 100 soldiers. Ahead lies a row of five battlefields, each worth one victory point. Simultaneously — without seeing the enemy's plan — each commander decides how many troops to send to each battlefield. The battlefield goes to whoever sends more troops there; ties are shared. The commander who wins more battlefields wins the war.

The rules fit on a cocktail napkin. Yet Colonel Blotto, as this game is known, has fascinated game theorists, economists, and military strategists since Borel formulated it in 1921. The reason: no pure strategy is safe. Whatever fixed allocation you announce, I can exploit it — send overwhelming force to the battlefields you left thin, and let you dominate the ones you flooded. The only rational play is to randomize: choose your allocation from a carefully designed probability distribution so your opponent can never predict where you will be strong.

Finding that optimal random strategy — the Nash equilibrium of the game — turns out to be surprisingly hard to characterize when the number of battlefields grows. For two battlefields the answer is trivial; for three it took decades of careful work; for many battlefields the full picture is still being studied today.

You have 100 troops and 5 battlefields. Fill in how many troops to send to each battlefield (they must sum to 100). The computer opponent uses a known near-optimal mixed strategy — it samples a random allocation from a distribution that no fixed human plan can reliably beat.

<p class="hint">{{hint_intro}}</p>
<div id="inputs-area">
  <div class="field-row" id="fields"></div>
  <div class="sum-display">{{troops_assigned}} <span id="sum-display">0</span> / 100</div>
</div>
<div class="btns">
  <button id="fight" type="button">{{fight}}</button>
  <button id="run100" type="button">{{run100}}</button>
  <button id="reset-btn" type="button" class="ghost">{{reset}}</button>
</div>
<div class="status" id="status"></div>
<div id="result-area" class="hidden">
  <table id="battle-table">
    <thead><tr><th>{{th_battlefield}}</th><th>{{th_you}}</th><th>{{th_computer}}</th><th>{{th_winner}}</th></tr></thead>
    <tbody id="battle-body"></tbody>
    <tfoot><tr><th>{{th_bfs_won}}</th><th id="you-total">—</th><th id="cpu-total">—</th><th id="outcome">—</th></tr></tfoot>
  </table>
</div>
<div id="stats-area" class="hidden">
  <div class="stats-row">
    <span>{{your_wins}} <b id="stat-wins">0</b></span>
    <span>{{cpu_wins_label}} <b id="stat-losses">0</b></span>
    <span>{{ties}} <b id="stat-ties">0</b></span>
  </div>
  <div class="bar-wrap"><div class="bar-fill" id="win-bar"></div></div>
  <div class="bar-label" id="bar-label"></div>
</div>

* { box-sizing: border-box; }
body { font-family: system-ui, sans-serif; color: #222; margin: 0; }
.hint { font-size: .88rem; color: #444; margin: 0 0 .8rem; line-height: 1.5; }
.field-row { display: flex; gap: 8px; flex-wrap: wrap; margin-bottom: .4rem; }
.field-box { display: flex; flex-direction: column; align-items: center; gap: 4px; }
.field-box label { font-size: .75rem; font-weight: 600; color: #1d3557; }
.field-box input { width: 58px; height: 40px; border: 1.5px solid #adb1b8; border-radius: 8px;
                   font: 700 16px ui-monospace, monospace; text-align: center; color: #1d3557; }
.field-box input:focus { outline: none; border-color: #1d3557; }
.sum-display { font-size: .85rem; color: #555; margin-bottom: .6rem; }
.sum-display.over { color: #c92f3c; font-weight: 700; }
.sum-display.exact { color: #0a7d33; font-weight: 700; }
.btns { display: flex; gap: .5rem; flex-wrap: wrap; margin-bottom: .6rem; }
button { font: 600 14px system-ui, sans-serif; padding: .45rem .9rem; border: 1px solid #1d3557;
         background: #1d3557; color: #fff; border-radius: 8px; cursor: pointer; }
button.ghost { background: #fff; color: #1d3557; }
button:disabled { opacity: .45; cursor: default; }
.status { font-size: 1rem; font-weight: 600; min-height: 1.4em; margin-bottom: .5rem; }
.status.ok { color: #0a7d33; }
.status.bad { color: #c92f3c; }
.status.tie { color: #b56a00; }
.hidden { display: none; }
table { border-collapse: collapse; width: 100%; font-size: .88rem; margin-top: .4rem; }
th, td { padding: .35rem .55rem; border: 1px solid #d0d7e0; text-align: center; }
thead th { background: #e8eef3; color: #1d3557; font-weight: 700; }
tfoot th { background: #e8eef3; font-weight: 700; }
.win-you { background: #d4edda; }
.win-cpu { background: #fde8e8; }
.tie-row { background: #fef9e7; }
.stats-row { display: flex; gap: 1.2rem; flex-wrap: wrap; font-size: .88rem; margin: .6rem 0 .3rem; }
.bar-wrap { height: 10px; background: #e0e6ec; border-radius: 5px; overflow: hidden; margin-bottom: .25rem; }
.bar-fill { height: 100%; background: #2a7f4f; border-radius: 5px; transition: width .4s; }
.bar-label { font-size: .78rem; color: #555; }

// Code not found

Notice that even a seemingly "smart" allocation (e.g. 30-25-20-15-10) often loses. The computer's randomized strategy is designed so that any fixed plan you submit is beaten on average. The only way to compete is to randomize yourself — and even then the equilibrium payoffs depend on the exact troop counts and battlefield values in ways that took decades to characterize.

Colonel Blotto looks like a toy, but its mathematics runs surprisingly deep.

• Pure strategies always lose. Any fixed allocation can be beaten: concentrate on the thin battlefields, concede the flooded ones. This forces both players into mixed strategies — probability distributions over allocations.
• The symmetric case was solved by Roberson in 2006. When both players have the same total troops and all battlefields are worth the same, Brian Roberson fully characterized the Nash equilibrium: each battlefield's marginal distribution must be uniform on a certain interval, and the joint distribution must use a clever geometric construction. This was a century after Borel posed the game.
• Asymmetric and weighted cases are still being studied. When one player has more troops, or some battlefields are worth more than others, or players can choose how many battlefields to contest, the equilibrium structure changes. Recent papers by Kovenock, Roberson, and others push the frontier further, but a complete theory does not yet exist.
• Computational complexity. Computing best-response strategies in large discrete Blotto games is non-trivial; finding approximate equilibria is an active topic in algorithmic game theory.
• Connection to Nash equilibrium. The game is a zero-sum two-player game, so a Nash equilibrium always exists (by the minimax theorem). The difficulty is not existence but explicit characterization and computation.

The status: partially solved — the symmetric equal-value case is settled (Roberson, 2006); the general case remains an active open area of research.

"Divide your limited resources across multiple arenas simultaneously, without knowing your opponent's plan" is one of the most common strategic shapes in the real world:

• Election campaigns: candidates allocate advertising budgets and campaign stops across swing states. Spending too much in a safe state wastes resources; too little in a contested one concedes it. Formal Blotto models have been used to study electoral competition.
• Cybersecurity: a defender allocates limited monitoring and patch capacity across network nodes; an attacker chooses which nodes to probe. Each side randomizes to stay unpredictable — a direct Blotto structure.
• Advertising auctions: competing firms bid across multiple ad slots or markets simultaneously, each trying to win the most valuable impressions without over-spending on any single one.
• Military logistics and counter-terrorism: allocating patrol routes, checkpoint density, or supply across theaters while the adversary probes for weak points.
• Sports drafts and fantasy leagues: distributing a salary cap across player positions so that no opponent can predict your vulnerabilities.

Understand Colonel Blotto and you've internalized the logic of simultaneous competitive resource allocation — a model that sits alongside Nash equilibrium and linear programming as a core tool for strategic thinking under conflict.

Colonel Blotto is a reminder that "simple rules" does not mean "easy strategy." Two players, fixed troops, win-more-battlefields — and yet the optimal play requires a carefully engineered randomized distribution that took a century to fully characterize even in the simplest symmetric case.

The next time you see a campaign allocating ad spend across swing states, or a security team spreading patches across servers, or a fantasy manager filling a roster within a salary cap — you are watching Colonel Blotto played in the real world. The math is still catching up.