minimax

Worst-case decision strategy

Minimax is a decision-making strategy that minimizes the maximum possible loss.

In game theory and computer science, minimax algorithms evaluate moves by assuming your opponent will always play optimally against you: The chess engine uses minimax to calculate the best move.

The approach applies broadly to any situation where you want to limit your worst-case outcome.

game-theory

zero-sum

Balanced gains and losses

equilibrium

algorithm

pruning

Cutting vegetation for health

backtracking · heuristic · cutoff · quiescence · ply · lookahead · propagation

games

chess

Strategic board game

shogi · xiangqi · draughts · backgammon · turn-based · two-player · endgame · AlphaGo

optimization

worst-case

Most unfavorable outcome imaginable

min-max · threshold

strategy

anticipation

State of awaiting something

foresight · checkmate · stalemate

statistics

estimator

Sample-based inference rule

Categories
Opposites
game-theoretic strategy type

minimaxtit-for-tat

Equivalent retaliation strategy

optimization target

minimaxmaximin

Maximizing minimum payoffs

game-theoretic approach

minimaxwin-win

Advantageous to both sides

mutual benefit

Phrases
Family

minimal, minimum, minimize, minimalist, minimalism, minimizes, minimization, minimizing, minimalistic

Familiarity
Top 1,000,000
Profile
Used worldwide · Timeless · Abstract · Rated G