Course Hero Logo

CSE 571 Fall 2021 HW2.pdf - CSE 571 Fall 2021 Homework 2...

Course Hero uses AI to attempt to automatically extract content from documents to surface to you and others so you can study better, e.g., in search results, to enrich docs, and more. This preview shows page 1 - 2 out of 2 pages.

CSE 571 Fall 2021Homework 2DueSeptember 9, ThursdayonlineOnly typed answers will be accepted.Be precise and concise in your answers.You may add hand-drawn figures when necessary.Exercise 1.1 (6pt)Prove each of the following statements, or give a counterexample:a. Breadth-first search is a special case of uniform-cost search.b. Depth-first search is a special case of best-first search.c. Uniform-cost search is a special case of Asearch.Exercise 1.2 (18pt)from textbookConsider the unbounded version of the regular 2D grid shown above. The start state is at the origin, (0, 0),and the goal state is at(x, y).The agent can choose action North, South, East, Westor Stayin any state.Considertree searchbelow (unless noted otherwise):a.What is the branching factorb (i.e., maximum possible transitions from each state)b.How many distinct states are there at depthk(fork > 0) in the search tree?c.What is the maximum number of nodes expanded by breadth-first search??

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
N/A
Tags
Depth first search, Search algorithm, A search algorithm, Admissible heuristic

Newly uploaded documents

Show More

Newly uploaded documents

Show More

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture