✳flâneur — a map of the web's best reading

Minimax | Brilliant Math & Science Wiki

brilliant.org · 1,514 words · saved by 1 readers

Forgot password? New user? Sign up Existing user? Log in Already have an account? Log in here. In game theory, minimax is a decision rule used to minimize the worst-case potential loss; in other words, a player considers all of the best opponent responses to his strategies, and selects the strategy such that the opponent's best strategy gives a payoff as large as possible. The name "minimax" comes from minimizing the loss involved when the opponent selects the strategy that gives maximum loss, and is useful in analyzing the first player's decisions both when the players move sequentially and when the players move simultaneously. In the latter case, minimax may give a Nash equilibrium of the game if some additional conditions hold. Minimax is also use

Minimax | Brilliant Math & Science Wiki Home Courses Sign up Log in The best way to learn math and computer science. Log in with Google Log in with Facebook Log in with email Join using Google Join using email Reset password New user? Sign up Existing user? Log in Sign up with Facebook or Sign up manually Already have an account? Log in here. Alexander Katz and Eli Ross contributed In game theory, minimax is a decision rule used to minimize the worst-case potential loss; in other words, a player considers all of the best opponent responses to his strategies, and selects the strategy such that

Explore this link on the map →

related reading