Classical algorithms, paired with the heuristics that steer them. The interactive lessons need JavaScript, but the whole reference surface is plain HTML: browse the atlas, every problem with its rival methods, or the categories. The eight live lessons: A*, simulated annealing, minimax, backtracking, branch and bound, Monte Carlo tree search, Dijkstra, union-find.