Adversarial Search
Book sections Sections 5.1-5.5
Slides: https://webeep.polimi.it/pluginfile.php/257113/mod_folder/content/0/FAI2021-07-AdversarialSearch.pdf
Introduction
In this chapter we cover competitive environments, in which two or more agents have conflicting g...
Minimax search
MAX wants to find a sequence of actions leading to a win, but MIN has something to say about it. ...
alpha-beta pruning
Reduces the complexity of the minimax search by not considering branches of the game tree that ca...
Monte Carlo Tree Search
The basic MCTS strategy does not use a heuristic evaluation function. Instead, the value of a sta...
Stochastic games
Many games include unpredictable stochastic events, like throwing of dice in backgammon We can ap...