Soldier/Pawn (S) can move only one straight step ahead. Only ifopponent coins are available, it can move in diagonally one stepforward toattack the opponent coin. Every move adds a penalty of 3 and everysuccessful attack gains a reward of 5.• Horses/Knight (H) can move either forward/backward in L - shapedstrides covering exactly 3 tiles. Every move adds a penalty of 5and everysuccessful attack gains a reward of 4
a. Construct game tree with utility value shown, up to level 3or one round per player followed by one more turn for 1st player.Assume that playerwith Black colored pieces moves first. Use the below function forstatic evaluation calculation.Board value = Utility of MAX player - Utility of MIN playerUtility of a plaver = Reward - Penaltyb. Apply minimax algorithm in the complete game tree constructedunder part a) to find the strategy of game if both were to playoptimally. Show each step in the algorithm.
Soldier Pawn S Can Move Only One Straight Step Ahead Only If Opponent Coins Are Available It Can Move In Diagonally 1 (36.46 KiB) Viewed 39 times
३ ●
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!