Dears,

Kindly, Ineed answer to this question

Use the above game tree to solve following problem:

1- Apply min max algorithm and show all necessary steps

2- Apply a/b and show all necessary steps

We slightly modified the above game tree as below. Solve following questions based on the tree below

1- L and R both have 50% chance- find the best move for P1 and show all the steps.

2- If L and R have 30% and 70% chance respectively which will be best move for P1

Game Tree P1 acts P2 acts P acts /R Utility 874-5 4 93 2 085 66 7-3 3 Game Tree P1 acts P2 acts P acts /R Utility 874-5 4 93 2 085 66 7-3 3