tic tac toe optimal move

Tic-Tac-Toe Python AI

A brute force approach to Tic Tac Toe


I have just created a fully working Tic-Tac-Toe AI which will never lose! It was an extremely interesting project as it helped me understand the concepts of recursion and the minimax algorithm. All the code in the project is available for download HERE.

To make this binary opponent of ours truly unbeatable I had to use a very useful algorithm which would allow the computer to calculate all possible moves and select the best one. This is known as a Shannon Type A algorithm as it uses a brute-force strategy to find the optimal play.

Continue reading →

GameMaker Studio 2

A student’s view on GameMaker Studio 2

GM?Do you know that feeling when you buy a product, only to realize that you don’t actually need it? I certainly do, and I want you to help you to avoid making that mistake by writing this review of GameMaker Studio 2 (GM2).

After having used GameMaker Studio (GM) for about 6 months and having tested GM2 for a month I would like to share my thoughts and my comments on it.

Continue reading →