We already know that tic-tac-toe is a solved game, meaning it is determined if both players play their best. This is, however, not so clear for the game of Chess. We will first start with a good game of tic-tac-toe, then refine the intuition into rigor on our way to proving the first formal theorem in the theory of games, credited to Ernst Zermelo. In full generality, we show that in two-player finite games of perfect information, there is always a strategy to reach a win or draw; with no regard to what the strategy should be. One could then ask the following question. Given a winning position, how quickly can a win be forced? We conclude the talk with a reflection on Zermelo’s findings as well as the powerful, non-intuitive consequences of his results.