Ever wonder how computer chess engines make decisions and are as competitive as humans? Most of these chess programs were partly designed by titled grandmaster or international masters. They use an algorithm very similar to a Minimax Tree. A minimax tree is simply a tree sorting algorithm that maximizes its own moves and assumes that its opponent will minimize his own score. In other words, computer chess players assume you will make the best move you can possibly make.