Implement the expectiminimax algorithm and the \*-alpha–beta algorithm,
which is described by Ballard:1983, for pruning game trees with chance nodes. Try
them on a game such as backgammon and measure the pruning effectiveness
of \*-alpha–beta.

Implement the expectiminimax algorithm and the \*-alpha–beta algorithm,
which is described by Ballard:1983, for pruning game trees with chance nodes. Try
them on a game such as backgammon and measure the pruning effectiveness
of \*-alpha–beta.