Last time, we built a naive minimax algorithm in Scala. While it was effective, it was unfortunately very slow. To increase the performance of the algorithm, we’ll implement a common variant of minimax with what is called “alpha-beta pruning”. Again,…
Implementing Minimax in Scala: Naive Minimax
Minimax is algorithm commonly used by AI in two-player games to determine the best possible move given a current state of the game. It gets its name from the intuitive concept that a player wants to minimize his opponent’s score…
Opening moves in the game of Go: Fuseki Stats
Go (or weiqi or baduk) is an extremely popular strategy game in East Asia that became more popular in the West during the last century. I first came across it several years ago and have played on an off since…