anuranjanpandey / AI-Tic-Tac-Toe

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

AI-Tic-Tac-Toe

The game is created using Minimax Algorithm. Minimax is a recursive algorithm which is used to choose an optimal move for a player assuming that the opponent is also playing optimally. As its name suggests, its goal is to minimize the maximum loss (minimize the worst case scenario).

How it works?

  • Download and run the game using script.py file.

  • Players is assigned symbol "X" and AI "O" automatically.

  • You are asked to enter the place number in which you wish to enter your symbol.

  • Who ever succeed in filling either all horizontal, vertical, diagonal or reverse diagonal with thier symbols Wins the game.