Tic-tac-toe-using-Minimax-Algorithm

By Sanskar Sharma PRN: 0120180381

Minimax Algorithm

Minimax is a kind of backtracking algorithm that is used in decision making and game theory to find the optimal move for a player, assuming that your opponent also plays optimally. It is widely used in two player turn-based games such as Tic-Tac-Toe, Backgammon, Mancala, Chess, etc.

Implementation of Tic-Tac-Toe game

Rules of the Game

1. The game is to be played between two people (in this program between HUMAN and COMPUTER).
2. One of the player chooses ‘O’ and the other ‘X’ to mark their respective cells.
3. The game starts with one of the players and the game ends when one of the players has one whole row/ column/ diagonal filled with his/her respective character (‘O’ or ‘X’).
4. If no one wins, then the game is said to be draw.