本文为 BJUT 2021 Fall Introduction to AI 的读书笔记;
课程教材为:Artificial Intelligence: A Modern Approach;
Minimax Search
#algorithm/search/adversarial_search #computer_science
Introduction
Is a kind of [[Adversarial Search]].
The original (partial) game tree for the tic-tac-toe game between MAX and MIN:
You can see that the utility values are labeled only for leaf nodes.
To find a proper strategy of a game, we can use the minimax value to label the nodes other than the leaf nodes using the MINIMAX function.