Title: Assignment: Project: Simple Minimax
Course: CS171: Introduction to Artificial Intelligence

Make sure your AI can perform simple minimax search with cutoff.  This will require implementing a heuristic function, e.g.:

h(board) = (# possible wins for self.player) - (# possible wins for opponent)

(it may be helpful to look at the example functions which calculate whether there is a win; these can easily be modified to calculate the number of ways still available to win).

and, a cutoff function, most simply a depth cutoff.  As a check, you should be able to get to about 4 ply with gravity (branching factor = width), and maybe 2 or 3 ply without (branching factor = width * height).