Computer Science, asked by uec19119, 11 months ago

Minimax algorithm produces the expected result for the root node only when

Answers

Answered by gaurav55538
1

Answer:

hope you understand

Explanation:

Root node represents the configuration of the board at which a decision must be made as to what is the best single move to make next. If it is my turn to move, then the root is labeled a "MAX" node indicating it is my turn; otherwise it is labeled a "MIN" node to indicate it is my opponent's turn.

Similar questions