MiniMax

An AI for board games

Description

Implementation of the MiniMax algorithm, tested on a TicTacToe.
The goal of the MiniMax algorithm is to play the best move given a current board.
For that, the algorithm will compute future moves, until a given depth is reached.
Pruning can be used to optimize performance and not compute every possible move.

This is a famous algorithm in board games, but can also be used elsewhere.
Stockfish, one of the best chess AI, is using MiniMax.

Tools

C#
Unity 3D (for rendering)