Question 1:
If we can reach a node B directly from G with a cost of 5 and via G A B with a cost of 4 then which path should
we choose according to dynamic programming to reach the same node and why? [3 marks]
Question 2:
Analyze and mention a search strategy that falls into heuristically informed search category and that guarantees to
always find out a solution? Give reason to support your answer? [5 marks]
Question 3:
For the game tree given below, show which branches would be pruned by Alpha-beta pruning and
Write down all the node values propagated by Alpha-beta pruning? [5 marks]
Solution will be upload soon
