FOR DISCUSSION ONLY (move out of here!):

Figure 4 more closely investigates the number of nodes expanded, reporting these numbers per move.

> BRANCHING FACTOR DECREASING AS THE GAME IS PLAYED
> HAPPENED TO BE 15 MOVES

> Q: CONSTANT CUTOFF DEPTH, VS. USING TIME -- ID WOULD AUTOMATICALLY RUN TO HIGHER DEPTHS AS GAME PROCEEDS
>
|
|:--:
| Figure 3: Nodes Expanded Per Move. In one game with 15 moves, the number of search nodes expanded by $\alpha\beta$-pruning and minimax before making their moves.