This document discusses game playing algorithms. It introduces the Min Max algorithm and Alpha Beta pruning algorithm. It provides an example of calculating the best decision for a game using the Min Max algorithm, which results in a board value of 214. It then shows an example of applying Alpha Beta pruning to the same game, which results in a lower board value of 174 by pruning branches that do not need to be evaluated.