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?
Analyze and mention a search strategy that falls into heuristically informed search category and that guaran always find out a solution? Give reason to support your answer? [5 marks]
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]
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?
0 comments
Post a Comment