All the AI hype these days is around deep learning and that machines eventually are getting rid of us humans. However, the ground work of AI without which no self driving car and no AlphaGo Zero would work is search algorithms.

In this talk we will use a simple game of exiting a maze to illustrate the differences between depth first and breadth first search. We will also solve the mystery around A* and what makes it such a powerful approach.

In the next step we will look at how to compete against other players using adversarial search like the one used in the leading chess engine stockfish. You will understand Monte Carlo Tree Search which was used in Alpha(Go) Zero to beat the world’s best Go players.