Skip to main content
Category: Strategies
Type: Game Theory Strategy
Origin: 1944, John von Neumann (Mathematician)
Also known as: Minimax Theorem, Minimax Criterion
Quick Answer — Minimax Strategy is a decision-making framework in game theory where you choose the option that minimizes your maximum possible loss. Developed by John von Neumann in 1944, this approach ensures you never face the worst-case outcome, making it essential for competitive situations where opponents actively try to harm your position.

​
What is Minimax Strategy?

Minimax is a conservative strategy that assumes your opponent is trying to maximize your losses while you try to minimize them. The core idea is simple: among all your possible choices, pick the one that gives you the best outcome in the worst-case scenario. This approach is fundamentally pessimistic—it plans for the worst—but that pessimism becomes a strength in adversarial situations.
“If you assume no adversary, you get no defense. Minimax assumes the adversary is always present and always trying to win.” — John von Neumann
The strategy emerges naturally in zero-sum games where one player’s gain is another’s loss. In such competitive environments, assuming your opponent will exploit any weakness is not paranoia—it’s rational planning. Minimax tells you how to play safely without completely giving up the chance to win.

​
Minimax Strategy in 3 Depths

  • Beginner: Imagine choosing a route to work. If one route is fastest but floods during heavy rain (10% chance of 1-hour delay), while another is always 30 minutes, minimax chooses the reliable route. You sacrifice potential speed for guaranteed safety.
  • Practitioner: In negotiations, minimax means never accepting a deal worse than your best alternative (your BATNA). You walk away from any offer that leaves you worse off than your fallback option, ensuring you never face the worst possible outcome.
  • Advanced: Minimax extends beyond games to algorithm design, artificial intelligence, and political science. Chess computers use minimax (with alpha-beta pruning) to evaluate positions by assuming the opponent will make the best possible move. In voting theory, minimax criteria evaluate electoral systems by their worst-case failure modes.

​
Origin

The minimax theorem emerged from John von Neumann’s groundbreaking work in game theory. In his 1928 paper “Zur Theorie der Gesellschaftsspiele” (On the Theory of Board Games) and later in the landmark 1944 book “Theory of Games and Economic Behavior” (co-authored with Oskar Morgenstern), von Neumann proved that every finite zero-sum game has a rational solution. The theorem states that in any zero-sum game with perfect information, there exists a value v and a strategy for each player such that one player can guarantee at least v, while the other cannot prevent them from getting more than v. This “minimax” equilibrium became the foundation of modern game theory and was later extended by John Nash to non-zero-sum games. Von Neumann also applied minimax thinking to nuclear strategy during the Cold War, co-developing the doctrine of mutually assured destruction (MAD)—the terrifying logic that made nuclear war unthinkably costly for both sides.

​
Key Points

1

Identify All Possible Outcomes

First, map every decision you can make and every possible response from your opponent. In chess, this means looking at every legal move; in business, it means considering every plausible competitive response.
2

Find the Worst-Case for Each Choice

For each of your possible actions, determine what your opponent would do to hurt you most. This isn’t about what they will do—it’s about what they could do. Minimax plans for the worst.
3

Choose the Least Bad Option

Select the action whose worst-case outcome is better than every other action’s worst-case. You’re not maximizing your potential gain—you’re minimizing your potential loss.
4

Accept the Trade-off

Minimax often means accepting suboptimal average outcomes to avoid catastrophic ones. You sacrifice upside for security. This trade-off makes sense when a single bad outcome could be devastating.

​
Applications

Financial Risk Management

Portfolio managers use minimax-style analysis to stress-test investments. They ask: “What’s the worst this portfolio could do in a market crash?” If the downside exceeds tolerance, they hedge—even if that reduces expected returns.

Military Strategy

Military planners have long used minimax logic. Defensive positions are chosen not for their best-case strength but for their worst-case resilience. Wars are planned assuming opponents will exploit every weakness.

Artificial Intelligence

Game-playing AI—from chess programs to poker bots—uses minimax variants. The computer assumes the opponent will always make the optimal move and chooses its own moves accordingly. Alpha-beta pruning makes this computationally feasible.

Legal Negotiation

Lawyers use minimax thinking when advising clients on settlement offers. The question isn’t “what’s the best we could get?” but “what’s the worst outcome if we go to trial?” This shapes their negotiation floor.

​
Case Study

The Cold War nuclear strategy of Mutually Assured Destruction (MAD) represents minimax applied at civilizational scale. Throughout the 1950s and 1960s, both the United States and the Soviet Union built massive nuclear arsenals not to win a war, but to ensure that starting a war would be suicidal. The logic was straightforward: if either side launched a first strike hoping to destroy the other’s retaliation capability, the surviving nuclear forces would still deliver unacceptable damage. The worst-case outcome—national annihilation—was guaranteed to both sides regardless of who struck first. By the minimax criterion, neither side could improve their position through attack, making pre-emptive war irrational. Mathematician John von Neumann, who helped develop nuclear strategy, reportedly said: “If you say why not bomb them tomorrow, I say why not today? If you say five o’clock, I say one o’clock.” This chilling endorsement of escalation reflected his minimax thinking—if nuclear war was inevitable, getting it over with quickly made strategic sense. MAD eventually emerged as the grim equilibrium that prevented direct superpower conflict for four decades.

​
Boundaries and Failure Modes

Minimax works best in zero-sum situations where opponents have directly conflicting interests. In cooperative or mixed-motive games, the strategy becomes excessively paranoid—assuming antagonism where collaboration could produce better outcomes for all. Business partnerships aren’t wars; treating them as adversarial relationships destroys value. The approach also breaks down when you cannot accurately model all possible opponent responses. If you’re facing an irrational actor, a random actor, or one whose goals you misunderstand, minimax can lead to over-preparation for the wrong threats. The strategy is only as good as your model of the adversary. Finally, minimax is computationally expensive. For complex games like chess, the full minimax tree is impossibly large. While pruning techniques help, they require significant resources—a limitation that drives much AI research.

​
Common Misconceptions

Minimax is about optimizing for worst-case scenarios, not avoiding risk entirely. You still take calculated risks—you simply ensure those risks won’t catastrophically exceed your tolerance. A venture capitalist might apply minimax by limiting any single investment to 5% of their fund, even if 10% bets could yield higher returns.
While born in game theory, minimax applies widely: medical treatment decisions (worst side effect), career choices (worst job market scenario), and infrastructure design (worst natural disaster). Anywhere an adversary or uncertain environment exists, minimax thinking helps.
Pessimism in planning isn’t a character flaw—it’s a risk management discipline. The strategy doesn’t prevent optimistic action; it ensures you won’t be wiped out by overconfidence. Many successful investors and generals are systematic pessimists who plan for disasters that never come.

Maximin

The inverse of minimax: maximize your minimum guaranteed outcome. Used in cooperative games where you want to ensure a baseline regardless of what others do.

Nash Equilibrium

John Nash’s extension of minimax to non-zero-sum games. A state where no player can improve their outcome by unilaterally changing strategy.

Zero-Sum Game

A situation where one player’s gains exactly equal the other player’s losses. Minimax is the optimal strategy for all finite zero-sum games.

BATNA

Best Alternative to Negotiated Agreement—the fallback option that sets your minimum acceptable outcome. Your BATNA defines your minimax position in negotiations.

Zero-Sum Thinking

The cognitive pattern of viewing situations as pure competition. Minimax is the formal game-theoretic foundation for this intuitive approach.

​
One-Line Takeaway

Minimax Strategy teaches you to plan for the worst so you can confidently pursue the best—assume your opponent will exploit every weakness, and choose the path where exploitation still leaves you standing.