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 L$-$shaped 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 leaming 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

Evaluations will be based on the following.

Use Min$-$Max algorithm and implement the game in PYTHON

Interactive implementation. Dynamic inputs$-$based nun of the game with

step wise board display and error free game ending.

Important Note:

You are provided with the python notebook template which stipulates the

structure of code and documentation. Use well intended python code.

Use a separate MS word document for explaining the theory part. Do not

include the theory part in the Python notebook except Python comments.

The implementation code must be completely original and executable.

Please keep your work $($code$,$ documentation$)$ confidential. If your code is

found to be plagiarized, you will be penalized severely. Parties involved in the

copy will be considered equal partners and will be penalized severely.