HW 2 [CS 6613 Fall 2013] - CS 6613 HW 2 Fall 2013 E. K....

This preview shows page 1 - 2 out of 2 pages.

CS 6613Fall 2013HW 2E. K. WongTotal points = 80.1. [15 points]Is each of the following statements true? Why or why not?(a)Breadth-first search is a special case of uniform-cost search.(b)Breadth-first search, depth-first search, and uniform-cost search are special cases ofbest-first search.(c)Uniform-cost search is a special case ofA*search.2. [45 points]Given the simplified road map of part of Romania in Figure 1 (on page 2),the goalis to find the shortest-distance path between the start city ofBucharestand the destination city ofSibiu. Draw the search tree produced for each of the search strategies (a), (b), and (c) below.Indicate the order nodes are expanded by putting a number to the right of each expanded node.Also, highlight the solution path and list the content of theexplored listat the end of the search.(a)GRAPH-SEARCHalgorithm withbreadth-first searchstrategy.(b)GRAPH-SEARCHalgorithm withuniform-cost searchstrategy. In addition to theabove required information for the tree, put down the

Upload your study docs or become a

Course Hero member to access this document

End of preview. Want to read all 2 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
EdwardWong
Tags
Artificial Intelligence, Graph Theory, Search algorithms, Search algorithm, Sibiu, graph search algorithm

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture