Question 1 Game Problem statement Simulate the working of chess with the below sample smaller game board. A player with any piece/coin standing where its opponent sacrifices all the piece/coin is a win for the first player. Soldier/Pawn (S) can move only one straight step ahead. Only if opponent coins are available, it can move in diagonally one step forward to attack the opponent coin. Horses/Knight(H) can move either forward/backward in Lshaped strides covering exactly 3 tiles. It is the only piece that can jump over other coins Elephant/Rook (E) can move either vertically or horizontally up to maximum length of the board. a. You are free to choose your own static evaluation function. Justify your choice of static evaluation value design and explain with a sample game state. Do not use any machine learning model for the evaluation function. b. Similar to the virtual lab example, one of the players must be a human ie., it must get dynamic inputs from us. The other player must be simulated using the program. c. Implement Python code for the design under part a, using Minimax Algorithm

Refer to the problem statement documents for the detailed evaluation criteria for the problem.

Neat and efficient code.

The required output (Solution, Sequence of Assignments & backtracked variables, Dynamic inputs in Game) to be printed as mentioned in the problem. Print the change in alpha beta values in every propagation. ATLEAST FOR ONE PLAYER THE PROGRAM SHOULD GET THE DYNAMIC GAME MOVES FROM THE USER similar to the webinar demo'd program.