Assignment 3: Tic-Tac-Toe Agents in Python

In this assignment, you are going to use Minimax search to implement two Tic-Tac-Toe (TTT) agents to play a TTT game.

Requirements:

A 3x3 TTT Board.

The two agents can use

the same Minimax search algorithm.

Two TTT agents: Agent X and Agent O. Agent X always makes the first move and the first

move must be a random move.

The moves and the results should be printed out as the following. Result Should be one of

the following 3: X Wins!, O Wins!, or Draw Game.

***

*X*

***

*O*

*X*

***

*O*

*X*

**X

*OO

*X*

**X

XOO

*X*

**X

Result: X Wins!

Minimax search must be implemented in this assignment