In this section, I'll show you how to analyze two-player games played on graphs. You will learn to determine who wins when both players play perfectly, and how to find winning strategies. Games on graphs appear in competitive programming, AI, and network security.
The techniques you will learn handle simple Nim variants and complex pursuit-evasion problems alike. By the end, you will solve problems like Cat and Mouse, understand Sprague-Grundy theory, and analyze games with cycles.
