15-212: Principles of Programming

Lecture 15: Game Tree Search

In this lecture we give an example of modularity and code reuse by illustrating a generic game tree search algorithm. By carefully specifying the interface between the game and the search procedure, the code can be written very generally, yet still applied to a wide variety of games. We illustrate this through a very simple minimax game tree search algorithm, but the underlying concepts and techniques become even more important as the sophistication of the search algorithm increases.

Key Concepts

Sample Code

[ CS 15-212 Home page | schedule | language | assignments | handouts ]

Michael Erdmann