1. What is the minimax algorithm used for in adversarial search? Provide an example.

2. What is alpha-beta pruning and how does it improve the efficiency of the minimax algorithm?

3. What is a heuristic function and how is it used in adversarial search algorithms?

4. What is the difference between a deterministic and a stochastic game in the context of adversarial search algorithms?

5. How do Monte Carlo Tree Search and Upper Confidence Bound Tree Search differ from the minimax algorithm?