Minimax Improvements

In the last post we discussed the implementation of Minimax for game AIs, specifically with Gomoku. In this post, we’ll cover general improvements for minimax that can be made. While they might not all apply to all games, they may apply to general zero-sum games, like chess, connect four, checkers, etc… Note that most of these improvements are very game-specific.

If you have conducted all the above steps that apply for your game, you have just created a very strong program for your game that can probably beat humans! Unless—of course—if you are coding Go. For that, you will have to look into the Monte Carlo tree search, that I will cover in a future post. Until then, thanks for reading!

Leave feedback and/or improvements please!