Question

What is minimax algorithm and how does it work? In compared to previous uninformed search and heuristics search, what are new features of the minimax search?

Is for Artificial Intelligence for Computer Science

Answer 1

1st Part:

Mini-max algorithm can be defined as a specific set of organized instructions which is useful in decision making. The mini-max algorithm is turn based and helpful to find the optimal next move.

It is mainly applicable in the areas of two player games. Between the two participants one is maximizer who tries to achieve the maximum score and the other is the minimizer who tries to achieve the minimum score. This is an example of zero sum game which makes the total score zero. One player tries to maximize the score and the other tries to minimize the score by countering the moves. One player's loss is other player's gain. The target is to find the optimal next move. In the end there is a winner and a loser.

2nd Part:

Unlike the uninformed search and heuristics search we start from the end or bottom in the mini-max search. In this technique we use backed-up evaluation as one chooses the best possible move assuming the opponent has chosen the best move possible.

Hope this helps.