Assignment No. 02 SEMESTER Spring 2011 CS607­Artificial Intelligence

Total Marks: 20 Due Date: 28/4/2011

Instructions Please read the following instructions carefully before submitting assignment: It should be clear that your assignment will not get any credit if: o The assignment is submitted after due date. o The submitted assignment does not open or file corrupt. o The assignment is copied. o There is not mentioned the student Id in the assignment File or name of file is other than student ID. GOOD LUCK

 

Marks: 20

Question # 1

Out of three search strategies that fall into uninformed search category which search strategy is better to be used in a situation in which we are sure that our goal lies deeper in the last level of the tree and not on the top levels? Also tell why? [4 marks]

Question # 2

Out of three types of search strategies that fall into uninformed search category which search strategy is best to be used when we are sure that our goal lies at the top three levels of the tree and not deeper into the tree? Also tell why? [4 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? [6 marks]