I discovered a bug in the game I had written on Tic Tac Toe. When the board is in a certain state, the system did not take the obvious winning move. It still won the game, but with an extra move required. This article details how to write a failing unit test to reproduce the issue and how to update the minimax …
Read More

This is the fourth part in this trilogy! - with a brief interlude last week for an introduction to the Minimax algorithm. This article builds on the App from part 1 and 2, which allows two players to play Tic Tac Toe. In this article we will implement the minimax algorithm to determin the best move for the computer to …
Read More

The Minimax algorithm is a type of backtracking algorithm used in Game Theory to determine the best move to make assuming your opponent is also making their best move. The use of Minimax algorithm is a form of Artificial Intelligence that does not involve Machine Learning. This article explains Minimax algorithm and …
Read More