Parallel Computing: Lecture 23

Learning objectives

After this class, you should be able to:

1. Given a game and an initial state, draw the game tree, evaluate it with or without alpha-beta pruning, and determine an optimal move.
2. Describe the different parallelization strategies for game tree evaluation, and explain their relative advantages and disadvantages.

Reading assignment

1. Chapter 16, sections 16.8 - 16.9.
2. None.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 16.9.
  2. Exercise 16.10.
  3. Exercise 16.11.

• Questions on next lecture's material
  1. None.