Design and implement a program that plays the game Animal Checkers (described below) and answer several questions (also described below) about the program. With luck, the programs will compete in a tournament to be held shortly after the due date. Your program will play Animal Checkers interactively against a human opponent, with either the program or the opponent playing first. It will, after each move, display the current state of the game board, and it will employ a static evaluation function (SEF) to evaluate board configurations. You may write the program in any programming language you choose. Your program may employ any of the algorithms for move selection --- minimax, alpha-beta pruning, forward pruning, etc. --- that we discuss, and any modifications that you think are appropriate. Note that the major operations of the program --- and the major challenges --- are these: Representing the game board and implementing moves on it; Displaying the game board and interacting with the opponent; Evaluating board configurations: the static evaluation function; and Organizing the search of the game tree on which move selection is based.