Question

1) Suppose we are able to do MiniMax search over the entire search tree. The strategy developed using the values backed up from this search will be optimal 1 point
against every player?
True
False
​

Answer 1

Answer:

True...................

Answer 2

Answer:

The Answer to your question is False.

Explanation:

• Minimax is a backtracking method used in decision-making and game theory to determine the best move for a player, provided that their opponent is likewise playing optimally. Tic-Tac-Toe, Backgammon, Mancala, Chess, and other two-player turn-based games use it extensively.

• MiniMax will only provide optimum strategy versus an optimal player throughout the whole search tree; if the opponent is optimal, MiniMax will not be able to exploit the opponent's vulnerability.

#SPJ3