You have an 8x8 board, players take turns placing a piece on any grid. First player to get 4 in a line (either a row, a column or a diagonal) wins.

The purpose of this project is to apply Minimax algorithm and see how it can produce the most optimal move.

Technologies used : Java

Tools : Netbeans

Source Code