Lecture notes and audio for today's class are available...

[Subbarao Kambhampati <rao@asu.edu>]

The slides are at

http://rakaposhi.eas.asu.edu/cse471/week13-s09.ppt 
?(start at slide 44--which says 4/24? and end at slide 63--which says "4/24 class ended here")

here is the link to the audio

http://rakaposhi.eas.asu.edu/cse471/cse471-s09-week14.1.WAV

Here is a summary of what is done 

Audio
of [Apr 24, 2009] (Make-up for April 28th class). Policy Iteration for
MDPS, Finding policies in dynamic domains. Real-time dynamic
programming. RTA* as a special case. Going from dynamic to multi-agent
domains--where RTDP becomes
min-max (or max-max if you are Ned in Simpsons). Discussion of
adversarial search. Types of games (and the exciting nature of
deterministic version of Snakes and Ladders ;-). Minmax with
depth-first search. Alpha-beta pruning. The effectiveness of
alpha-beta pruning.

You now have everything needed to do all parts of homework except the learning ones. 


When I come back for the regular class on Thursday, I will tie up a few loose ends on game tree search (~15min)
and start learning? (for which we will cover 18.1-18.5 and then 20.1 and 20.2)

rao

Ps: As I said, the Tuesday class will now be an optional review session lead by Will Cushing.