MiniMax implementation with look-ahead and a/ß pruning in Java

MiniMax is a decision rule used in decision theory, games theory, statistics, economics and philosophy for minimizing the possible loss while maximizing the potential gain.

Published in 1928 by John von Neumann, although modified and optimized, it is still the basis of many algorithms.

The a/ß pruning optimization has proved decisive in all implementations.

Let’s find out together through a small example written in Java.

Read more…