homework3 ch4

Artificial Intelligence: A Modern Approach

Info icon This preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: ICS 171, Summer 2000: Lecture 3 Homework Stephen D. Bay August 15, 2000 Due: August 22, 2000 1 Consider the following graph representing the state space and operators of a navigation problem: 5 A 3 7 S 2 B 1 C 5 2 H 4 4 4 3 2 E 1 1 F G 3 D 2 0 2 4 The path cost is shown by the number on the links; the heuristic evaluation is shown by the number in the box. When placing expanded child nodes on a queue, assume that the child nodes are placed in alphabetical order i.e. if node S is expanded the queue will be: A B Assume that we never generate child nodes that appear as ancestors of the current node in the search tree. a What is the order that best rst search will expand the nodes? b What is the order that uniform cost search will expand the nodes? c What is the order that A* search will expand the nodes? d What is the order that IDA* search will expand the nodes? e What is the order that hill-climbing search will expand the nodes? 1 2 What will happen in best rst search if we set = , ? 3 Question 4.2, parts b, c, and d in the course text Russell & Norvig, page 118. 4 Suppose that 1 and 2 are admissible heuristics. Which of the following are admissible? h n g n h h 1 + 2 2 h h 2 max h1 h1 ; h2 5 If F and 2 are admissible heuristics, which is the better method of combining them: = max 1 2 or = 1 + 2 2? Explain. h1 h h ;h G h h = 2...
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern