The high branching factor of this problem makes it difficult to reach a deep enough depth for an intelligent AI, while also returning suggested moves within a short enough time. There are several ways in which we can reduce branching: Alpha-beta pruning While searching the minimax tree for the...
Base homework (required): Create a program to play the game, using, depending on specification in the input file, either the plain Minimax algorithm with depth limit, or Alpha-Beta Pruning. Competition mode (optional): Your algorithm will play against the other students’ algorithms in a tourna...