Problem Reduction Search: definition; comparison to state
space search; AND/OR graph; solution to an AND/OR graph; use of a
model to find counter-examples; when to pick node most likely to
succeed (fail).

Descriptions of games with AND/OR graphs: game tree;
reason for using an AND/OR graph; static evaluation function; depth
bound; minimax position evaluation; be able to do a minimax evaluation
of a given game tree. Alpha/beta search: algorithm, cutoffs,
advantages, comparison to plain minimax search; be able to show
alpha/beta search on a given game tree.