top of page


Last update: January, 2021

A tic-tac-toe game prototype using the Minimax Algorithm it is possible to find the best move through the valid options, from the end of the game.


If player A can win with one move, this is his best move. If player B identifies that one move will lead to a situation where the opponent can win in the next move and there is another move that can lead to a situation where the opponent can, at least, draw, then this last move is the best move for him. After a few rounds, it is easy to identify which is the best move. 

bottom of page