- Minimax improvements:
- Alpha-beta pruning
- Cut off branches that aren’t useful in the minimax search tree
- Iterative Deepening Search:
- Iteratively go through the tree by applying minimax at increasing depths, giving us a more optimized performance within the 500ms timeframe
- Move Ordering:
- Save the moves from the previous minimax and explore those first, improves execution speed by prioritizing good moves
Iterative Deepening Search