ex2 - CS221 Exercise Set #2 1 CS 221, Autumn 2006 Exercise...

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

View Full Document Right Arrow Icon
CS221 Exercise Set #2 1 CS 221, Autumn 2006 Handout #8 1. In this problem, you will demonstrate the A* search strategy on the given tree. The start state is denoted by S and the goal state by G . Number the nodes in the tree according to the order in which they will be expanded . (Recall that a node is expanded when it is removed from the list of nodes, checked for “goalness”, and its children are inserted into the list.) Do not number a node if it is not expanded in the search. Assume that nodes of equal priority are inserted into the list in left-to-right order, and extracted from the list in the same (FIFO) order. The h -value of each node and the costs of the edges are as speci±ed on the tree. In addition to numbering the nodes, write down the f -value of the di²erent nodes in the tree. You only need to write down f -values for nodes that are inserted into the list. S f= 3 h=4 f= h=7 f= f= f= f= f= h=5 h=3 2 h=3 f= h=2 f= f= G f= f= h=5 f= h=4 f= f= 1 2 2 3 1 2 3 1 f= 2 2 2 1 1 3 h=3 h=2 h=1 h=2 h=1 h=0 h=1 h=1 h=0 f= h=3 f= 2. This question is a continuation of problem 3 in Exercise Set #1. The (a) and (b) subprob- lems are identical to 4.(a) and 4.(b) from Exercise Set #1. Consider the task of scheduling n ±nal exams in Gates Building. For each exam, we have the list of students that must take the exam. Our task is to assign each exam to a time slot. More than one exam may be assigned to a time slot, but there are two constraints: no student will be required to take two exams at the same time, and at most k exams may be scheduled in a time slot (since only k rooms are available for this purpose). (a) Provide a detailed representation of your search space. Your description must be precise, i.e., you should provide an exact speci±cation of the components of the state description (state space, initial state, operators, goal test), of the constraints under which each operator can be applied, and of the e²ects of each operator on the state components. You may use either English or pseudocode. Make sure that your formu-
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 11/30/2009 for the course CS 221 taught by Professor Koller,ng during the Winter '09 term at Stanford.

Page1 / 4

ex2 - CS221 Exercise Set #2 1 CS 221, Autumn 2006 Exercise...

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