Question 1:View more random threads:
- Human Computer Interaction CS408 assignment 2 fall 2010
- mth202 Assignment NO:5 spring 2011 idea solution
- cs606assignment no 2 spring 2011 MAY Solution
- CS403 Database Management Systems Assignment No. 02...
- CS504 - Software Engineering Discuss about 4th Assignment...
- CS304 Object Oriented Programming assignment no 3 idea...
- CS410 Visual Programming Assignment No.1 Solution Spring...
- cs601 assignment no 1 April 2012 Due date 19 April 2012
- CS610 Computer Networks Assignment no 04 FALL January 2012
- cs703 assignment no 3 Solution 20th January 2016
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]
Sponsored Links