This $8$th time iam posting this question $,$Be careful while you answering this question.If wrong answer $,$you may expect multiple downvotes

Need code in Python with output screenshots

$***$USE MAZE AS GIVEN FIGURE $***$

Work Ethic: Academic integrity is of utmost importance. Each student is expected to complete this assignment independently, without seeking help from other students or external individuals, including engineers or professionals. Any violation of this code of honesty will be taken seriously and may result in penalties in accordance with the rules and regulations of the University of Central Missouri.

Description

Adversarial Maze is a two$-$player game played on a grid. Each player controls a character, and the goal of the game is to reach the other player's side of the grid. However, the players cannot move through walls.

On each turn, a player can move their character one square in any direction, as long as the square is not occupied by a wall or the other player's character. If a player moves their character onto the same square as the other player's character, they capture the other player's character. The captured character is then removed from the game and the capturer wins automatically.

The first player to reach the other player's side of the grid wins the game.

Exercise $1$

Implement an adversarial search algorithm to play Adversarial Maze. Your program should be able to play against a notable opponent, and it should be able to win as often as possible. Please remember the minimax algorithm, and then try to implement that.

You should follow some rules while implementing the algorithm:

Your implementation should work with the given topology

Your implementation should calculate the best action that could be done by two of the parties.

Include comments and clear documentation in your code for clarity.

$1$

rigure $1$: ine maze topoiogy.