IMPORTANT: Reminder about Thursday's Exam (it will be closed book and notes..)

Folks

I hope you all remember that there will be a test on Thursday during class time. 

 The test will be closed book and closed notes. It will be a short exam (by my standards anyway) and you should have plenty of time to complete it.  (It will also be the first ever "Made in Taiwan" exam that many of you may have taken ;-)

Rao

Video and Audio of Friday's make-up class lecture online now..

The video and audio are online.

Thanks to the folks who showed up. The others should make sure to hear the lecture so they can do the planning graph homework problems (which will be included in the next graded homework). [As I said, what I covered in this lecture is not going to be on the test 

on Thursday).

Rao

Re: (Make-up) Class Friday in BY 210 10--11:15 AM

BYENG--just half floor above our class room, next to the advising office.

rao

On Fri, Feb 3, 2012 at 12:12 AM, Ivan Zhou <izhou@asu.edu> wrote:

Is this BYENG or BYAC?

On Thu, Feb 2, 2012 at 6:12 PM, Subbarao Kambhampati <rao@asu.edu> wrote:

Just a reminder that Friday (tomorrow's) make-up class is going to be in BY 210. 

It will be from 10AM to 11:15AM.

Rao

--
Ivan Zhou

Graduate Student

Graduate Professional Student Association (GPSA) Assembly Member

Eta Kappa Nu (HKN) Active Member 

School of Computing, Informatics and Decision Systems Engineering

Ira A. Fulton School of Engineering

Arizona State University

Solutions to Homework 1 posted..

Folks

 I posted the solutions to homework 1 on the homework page  

I also posted the solutions to the progression and regression part of the planning question. These parts are fair-game for the Thursday test. 

I didn't post the solutions to the rest of the planning questions--especially on planning graph--because it is not going to be on the test and I want to make it part of a required graded homework later.

You are strongly encouraged to  look at the solutions once before Tuesday and go to Tuesday's optional class if you have questions. The TA will be there to help go over them with you. You can also go to the TA office hours. 

By the way, your graded home works are not likely to get returned in time for Thursday's test.

cheers

Rao

(Make-up) Class Friday in BY 210 10--11:15 AM

Just a reminder that Friday (tomorrow's) make-up class is going to be in BY 210. 

It will be from 10AM to 11:15AM.

Rao

(Ungraded) homework question on Planning

Folks

I added a question planning (see http://rakaposhi.eas.asu.edu/cse471/hw1-s12-planning-qn.txt ) 

This part will not be graded (i.e., you don't need to submit it), but you should do it so you have an idea about the kind of 

questions that can be asked on planning topics covered yesterday and tomorrow. 

I will supply the answers by next week. 

Rao

Exam specimen questions..

Folks

 You may want to note that Qn 11 on the homework, i.e., the one at http://rakaposhi.eas.asu.edu/cse471/hw2-f06-qn3-4.pdf

is directly from a previous midterm. So it gives you an idea of how the exam questions will look like

Also, I might ask True/False *with explanation* short answer questions such as the ones below:

For each of the following statements below, indicate whether the statement is true or false, and give a brief but precise justification for your answer. Correct answers *with correct justifications* will carry 2points. No points will be awarded for answers without correct justifications.  Example qn: The time and memory requirements of IDA* can be improved by using A* algorithm to do search in individual iterations.    Answer: False. Because A* in the worst case can take as much memory as breadth-first, and thus using A* in the individual iterations will make IDA* require exponential memory (instead of linear memory).   A. A* search does b^(d/2) node expansions when searching a unifrom tree of branching factor b and depth d, using a perfect heuristic.   B. Consider a uniform search tree of depth d and branching factor b, where there are many goal nodes, all of which are uniformly distributed at the leaf level d.  Assuming that memory consumption is not a problem, we are better off using breadth-first search than depth-first search in this scenario.  C. A* search with heuristic h=0 will always have to search the entire tree before finding the optimal solution.   D. Suppose A* search uses an evaluation function f(n) = (1-w) g(n) + w h(n). For any value of w between 0 and 1 (inclusive), A* will terminate and return optimal solution.    E. If h1 and h2 are two admissible heuristics, and h3 is defined as h3(n) = max(h1(n) , h2(n)) , then A* search with h3 is guaranteed to return an optimal solution while expanding as many or fewer nodes than either h1 or h2.