Consider the game of Chess as in below diagram. Assume the player with Black coin starts the move from this state. Soldier (S) coin 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. Every move adds a penalty of 2 and every successful attack gains a reward of 6. Horses (H) can move either forward/backward in L - shaped strides covering exactly 3 tiles. Every move adds a penalty of 5 and every successful attack gains a reward of 3. (3+3+4= 10 Marks) a) Expand the complete game tree(with neat diagram of the chess board or best state representation) from the given current state (0th level) as Start Node up to exactly 3 levels only (1", 2nd & 3rd Level) ie., one round for each of the player and an extra round for the first player. b) Calculate the static evaluation metric for the leaf of the tree. Justify your choice of the metric used. c) All the player plays under best case scenario. Apply the Alpha-Beta pruning on the game tree constructed in answer a) and highlight which node are pruned as a result. Show the step by step alpha beta value change at every node and find the best path chosen by players in the game given. | Consider the game of Chess as in below diagram. Assume the player with Black coin starts the move from this state. Soldier (S) coin 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. Every move adds a penalty of 2 and every successful attack gains a reward of 6. Horses (H) can move either forward/backward in L - shaped strides covering exactly 3 tiles. Every move adds a penalty of 5 and every successful attack gains a reward of 3. (3+3+4= 10 Marks) a) Expand the complete game tree(with neat diagram of the chess board or best state representation) from the given current state (0th level) as Start Node up to exactly 3 levels only (1", 2nd & 3rd Level) ie., one round for each of the player and an extra round for the first player. b) Calculate the static evaluation metric for the leaf of the tree. Justify your choice of the metric used. c) All the player plays under best case scenario. Apply the Alpha-Beta pruning on the game tree constructed in answer a) and highlight which node are pruned as a result. Show the step by step alpha beta value change at every node and find the best path chosen by players in the game given. |