(Solved): Implement in PYTHON: Problem \# 2: [Adversarial Search] Implement the Tic-Tac-Toe game for two ...

Implement in PYTHON:

Problem \# 2: [Adversarial Search] Implement the Tic-Tac-Toe game for two rational agents (Max and Min) who will play adversaries to each other using the Minimax algorithm. If the two rational agents play against each other in a zero-sum game, who will win actually? Given the following problem description, implement the following algorithms. (a) Minimax algorithm (without pruning) (b) Minimax with the Alpha-Beta pruning algorithm and show the level of the node which was pruned (assume that the start state is at level 0 ) - Random toss: declare who won the toss, Max or Min. The player who won the toss will take the first move - Players moves: represent Max move as an ' $\mathrm{X}$ ' and Min move as an ' $O$ ' - Start state: the $3\times 3$ board is empty initially - Successor function: no. of empty cells that can be filled by a player - Terminal states with utility values: Max wins (+1 utility), Min wins ( -1 utility), Draw (0 utility) - Program output: - Board configuration after each player's move Announce the winning player No. of moves taken by each player as the game ends Total no. of successor nodes generated by each player during search