# hw2 - CSE 327, Spring 2012 Homework #2: Chapters 3 and 5...

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

CSE 327, Spring 2012 Homework #2: Chapters 3 and 5 The following exercises are due at the beginning of class on Wednesday, February 15. This assignment includes an extra-credit assignment worth up to an additional 20 points. 1. [15 points] Use greedy best-first search to find a path from Vaslui to Sibiu, assuming the roads between cities and their lengths are given by the map in Figure 3.2 of the book (p. 68). Use the straight-line distance from each node to Sibiu as your heuristic function, assuming these distances are given by the following table: Arad 138 Mehadia 146 Bucharest 253 Neamt 237 Craiova 196 Oradea 148 Dobreta 183 Pitesti 162 Eforie 433 Rimnicu Vilcea 78 Fagaras 96 Sibiu 0 Giurgiu 272 Timisoara 141 Hirsova 385 Urziceni 302 Iasi 298 Vaslui 345 Lugoj 97 Zerind 146 Show your search tree, including the h(n) value for each node, and label each node with the order in which it is expanded (note, this may be different from the order it is generated). In order to reduce unnecessary search, you should use graph-based search. 2. [15 points] Now repeat the exercise above, but use A* instead of greedy best-first. Show your search tree, complete with f(n), g(n) and h(n) values for each node, and label each node with the order in which it is expanded. Once again, use a graph search approach, but remember that if a generated node has a lower f(n) than a frontier node with an identical state, then it must still be explored. 3.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/29/2012 for the course CSE 327 taught by Professor Heflin during the Spring '08 term at Lehigh University .

### Page1 / 3

hw2 - CSE 327, Spring 2012 Homework #2: Chapters 3 and 5...

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

View Full Document
Ask a homework question - tutors are online