##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Two-player games where positions are graph nodes. You analyze winning strategies using backward induction.
(The goal)
(Graph as game board)
(The simple solution)
(Where games end)
(Reverse topological solve)
(No cycles, no draws)
Knowledge check
(Draws from cycles)
(Win, lose, or draw)
(Minimax BFS pattern)
Knowledge check
(Problem setup)
(State space modeling)
(Terminal state marking)
(BFS propagation)
(Degree array technique)
(Drawing states)
(Time and space cost)
(Data structures needed)
(Turn logic details)
(Edge cases)
(Common pitfalls)
(Problem summary)
(Key differences)
(Sprague-Grundy theory)
(MEX computation)
(Combined games via XOR)
Knowledge check
(Pursuer vs evader)
(Single cop captures)
(Cop number of graphs)
(Problem setup)
(Losing position rule)
(Reverse topo processing)
(Linear time solution)
(Finding winning moves)
(Multi-coin variants)
(Pruning heuristics)
(BFS from terminals)
Alternating maximization an...
(Skipping irrelevant branches)
Knowledge check
(Avoiding recomputation)
(Introduction)
(Minimax on tree structure)
(Implementation)
(What you learned)
(Games that never end)
Identifying non-terminating...
Knowledge check
(Player positions alternate)
(Game-playing algorithms)
(Attacker vs defender games)
Path planning with adversaries
(Adding randomness to games)
(Runtime considerations)
(Problem recognition patterns)
(What to avoid)
Knowledge check
(Verification strategies)
(Beyond basic games)
(What you learned)