Summary and Next Lecture
Game trees are similar to search trees
- but have opposing players
Minimax characterises the value of nodes in the tree
- but is horribly inefficient
Use static evaluation when tree too big
Alpha-beta can cut off nodes that need not be searched
Next Time: More details on Alpha-Beta