Alpha-Beta Code Plan

Goal: write your own alpha-beta pruning evaluator. Keep track of the number of nodes you evaluate.

Input Data: the bottom of a depth $d$ binary tree, so $2^d$ numbers in a list. These represent the values at the bottom of the tree.

Output data:

1. a list of numbers of length $1 + 2^1 + 2^2 + \cdots + 2^d$ holding the optimal-play values of each node.
2. the number of evaluations performed