What is minimax procedure explain with example?

What is minimax procedure explain with example?

Mini-Max algorithm uses recursion to search through the game-tree. Min-Max algorithm is mostly used for game playing in AI. Such as Chess, Checkers, tic-tac-toe, go, and various tow-players game. This Algorithm computes the minimax decision for the current state.

How do you write a minimax algorithm?

3. Minimax Algorithm

1. Construct the complete game tree.
2. Evaluate scores for leaves using the evaluation function.
3. Back-up scores from leaves to root, considering the player type: For max player, select the child with the maximum score.
4. At the root node, choose the node with max value and perform the corresponding move.

What is maximin and minimax in game theory?

zero-sum game: A zero-sum game is one in which the sum of the individual payoffs for each outcome is zero. Minimax strategy: minimizing one’s own maximum loss. Maximin strategy: maximize one’s own minimum gain.

What is minimax criterion in decision making?

Min-max criterion – is a decision-making criterion presented in 1954 by Leonard Savage. This criterion minimizes the expected loss associated with making worse than optimal decision, for a given state of nature.

What is minimax used for?

Minimax (sometimes MinMax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as “maximin”—to maximize the minimum gain.

What is the Minimax principle in psychology?

Definition of minimax principle : a principle of choice for a decision problem: one should choose the action which minimizes the loss that can be suffered even under the worst circumstances.

What is Minimax used for?

What is Minimax strategy?

in game theory or decision making, a tactic in which individuals attempt either to minimize their own maximum losses or to reduce the most an opponent will gain.

What is a minimax strategy?

Minimax is a strategy of always minimizing the maximum possible loss which can result from a choice that a player makes.

Is minimax always optimal?

Typically, programs for game playing use the Minimax strategy [5], which assumes that the opponent is a perfectly rational agent, who always performs optimal actions. In this case, at any given step, a move that is practically the best may not be one indicated by Minimax.

Is minimax a machine learning?

Some AI techniques don’t involve ML. The minimax algorithm is such an algorithm that makes computers behave intelligently but they are not learning anything. And despite that, it works quite well in many games.

What is Maximin economic strategy?

A maximin strategy is a strategy in game theory where a player makes a decision that yields the ‘best of the worst’ outcome. All decisions will have costs and benefits, and a maximin strategy is one that seeks out the decision that yields the smallest loss.