Tutorial slides - changes:

------------------------------------------------------------------------------------------------------------------------------------------
Version 2 to Version 3:
all slides have been updated with small fixes July 27.
Fixes to be described.
------------------------------------------------------------------------------------------------------------------------------------------
Version 1 to Version 2:
Part II
-- slides 6 & 7, indentation problem in the pseudo code, which changes the meaning of the algorithm 
-- slides 14, In uniform (b,d) tree, with OR node at root, number of nodes in best case is 1, 1, b, b, b2, b2,...--> ... number of terminal nodes ...

Part III
-- slide 6, indentation problem in the pseudo code, which changes the meaning of the algorithm 
-- slide 20, upper value --> upper bound
-- slide 32, score < alpha --> score <= alpha
-- slide 35, small fractional search depth --> small fractional depth (i.e., deeper search)

Part IV
-- slide 25: min(n.thpn,pn2)--->min(n.thpn,pn2+1), min(n.thdn,dn2)-->min(n.thdn,dn2+1)
-- slides 34 & 35: one arrow in the example is wrong.  Arrow D->B is correct, not D->A
-- slides 36 and 38, arrow pointing from E to H in the example is wrong.  It should be from F to H.
------------------------------------------------------------------------------------------------------------------------------------------