Here's something that helps me work through the AlphaBeta algorithm when checking a tree, maybe it will help someone else.
It's a summation of the algorithm on pg170.
If you're in a MAX node, follow the sequence in the red block for each child
If you're in a MIN node, follow the sequence in the blue block for each child
pruning returns v
ending possibly updates a or B and returns v.