HW2 - CS 540 HW 2 Searching for Solutions Assigned...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 540 HW 2 – Searching for Solutions Assigned: 2/20/08 Due: 3/5/08 (cannot be turned in later than 4pm 3/7/08 so solution can be released before the midterm) Points: 100 Note: all the questions on this homework are ‘paper and pencil’ ones. Problem 1 (40 points) Consider the search space below, where S is the start node and G 1 , G 2 , and G 3 satisfy the goal test. Arcs are labeled with the cost of traversing them and the h function’s values are reported beside the graph. For each of the following search strategies, indicate which goal state is reached (if any) and list, in order , all the states popped off of the OPEN list . When all else is equal, nodes should be removed from OPEN in alphabetical order. a. Breadth First e. Best-first (using f = h) b. Depth First f. Best-first (using f = g + h) c. Iterative Deepening g. Beam Search (with beam width = 2 and f = h) d. Uniform Cost h. Hill Climbing (using the h function only) 15 4 1 3 6 7 10 2 1 2 E G 1 G 2 G 3 11 5 3 D S C B h(S) = 100 h(A) = 10 h(B) = 25 h(C) = 1 h(D) = 3 h(E) = 6 h(G1) = 0 h(G2) = 0 h(G3) = 0 A
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/01/2010 for the course CSCI 561 at USC.

Page1 / 2

HW2 - CS 540 HW 2 Searching for Solutions Assigned...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online