Video
Search: Games, Minimax, and Alpha-Beta
In this lecture, we consider strategies for adversarial games such as chess. We discuss the minimax algorithm, and how alpha-beta pruning improves its efficiency. We then examine progressive deepening, which ensures that some answer is always available.
The step-by-step explanation on how to find the minimax, also giving very easy to understand example. The use of blackboard to imitate animation really helps to visualise the problem. it helped me to understand how a search algorithm finds the best path to take, which can minimize the time and resources needed.