(Warning: this is a 2gig avi file..)
On Fri, Apr 24, 2009 at 3:40 PM, Subbarao Kambhampati <firstname.lastname@example.org> wrote:
The slides are at
(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
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)
Ps: As I said, the Tuesday class will now be an optional review session lead by Will Cushing.