Develop a general game-playing program, capable of playing a variety of games. 

a. Implement move generators and evaluation functions for one or more of the following games: Kalah, Connect Four, Othello (Reversi), checkers, and chess. 

b. Construct a general alpha–beta game-playing agent.

c. Compare the effect of increasing search depth, improving move ordering, and improving the evaluation function. How close does your effective branching factor come to the ideal case of perfect move ordering? 

d. Implement a selective search algorithm, such as B* (Berliner, 1979), conspiracy number search (McAllester, 1988), or MGSS* (Russell and Wrefald, 1989) and compare its performance to A*.