legacy collection

Classical algorithms and heuristics.

The original 205 algonow lessons pair an algorithm with the heuristic that guides it. Explore the live diagrams, tested Python solutions, and complete narrations.

New puzzles focus on Python AI architecture and engineering. This collection remains available at its original lesson URLs.

settledfrontierpatha* × manhattan, live

all 205 legacy lessons

Sorting & Selection

Data Structures

Graph Algorithms

puzzle 01▶ ~7 min

A* search×Manhattan distance

Shortest paths on grid maps

puzzle 07▶ ~8 min

Dijkstra's algorithm×Binary heap priority queue

Nonnegative shortest paths

puzzle 15▶ ~8 min

Dinic's algorithm×Level-graph blocking flows

Maximum flow through a network

puzzle 21▶ ~8 min

Kahn's algorithm×Zero in-degree queue

Ordering dependencies

puzzle 23▶ ~8 min

Kruskal's algorithm×Union-find cycle test

Minimum spanning trees

puzzle 34▶ ~8 min

Bellman-Ford×Early-exit relaxation

Negative-edge shortest paths

puzzle 43▶ ~8 min

Hopcroft-Karp×Layered augmenting phases

Bipartite maximum matching

puzzle 50▶ ~8 min

Floyd-Warshall×Intermediate-vertex sweep

All-pairs shortest paths

puzzle 52▶ ~8 min

Tarjan's SCC algorithm×Low-link stack discipline

Strongly connected components

puzzle 57▶ ~8 min

Edmonds-Karp×Shortest augmenting paths

Maximum flow

puzzle 69▶ ~8 min

Push-relabel×FIFO vertex selection

Maximum flow

puzzle 72▶ ~8 min

Hungarian algorithm×Tight-edge alternating paths

Optimal assignment

puzzle 77▶ ~8 min

Prim's algorithm×Cheapest crossing edge

Minimum spanning trees

puzzle 82▶ ~8 min

Karger's algorithm×Random edge contraction

Minimum cut

puzzle 98▶ ~8 min

Louvain method×Greedy modularity moves

Community detection

puzzle 102▶ ~8 min

Johnson's algorithm×Reweighting potentials

Sparse all-pairs shortest paths

puzzle 122▶ ~8 min

Contraction hierarchies×Node-importance contraction order

Continental road routing

puzzle 123▶ ~8 min

Bron-Kerbosch×Tomita pivoting

Maximal clique listing

puzzle 142▶ ~8 min

Betweenness centrality×Brandes accumulation

Node importance

puzzle 155▶ ~9 min

IDA*×Manhattan distance

Memory-bound puzzle search

puzzle 168▶ ~10 min

Greedy graph coloring×DSatur saturation ordering

Vertex coloring

puzzle 198▶ ~10 min

Fruchterman-Reingold×Force-directed placement

Graph layout

Dynamic Programming & Combinatorics

Optimization & Operations Research

puzzle 02▶ ~7 min

Simulated annealing×Geometric cooling schedule

Traveling-salesman tours

puzzle 17▶ ~8 min

LRU caching×Least-recently-used eviction

Page and cache replacement

puzzle 39▶ ~8 min

Activity selection×Earliest-finish-first greedy

Non-overlapping selection

puzzle 48▶ ~8 min

Earliest deadline first×Dynamic deadline priority

Real-time scheduling

puzzle 67▶ ~8 min

Rate-monotonic scheduling×Shorter period wins

Real-time task scheduling

puzzle 73▶ ~8 min

Gale-Shapley×Deferred acceptance

Stable matching

puzzle 89▶ ~8 min

Greedy set cover×Maximum-coverage selection

Set cover approximation

puzzle 108▶ ~8 min

Secretary problem×1/e stopping rule

Optimal stopping

puzzle 117▶ ~8 min

Christofides×Matching plus Euler tour

Metric TSP approximation

puzzle 131▶ ~8 min

First fit decreasing×Descending size order

Bin packing

puzzle 135▶ ~8 min

Binomial options pricing×Cox-Ross-Rubinstein lattice

Option pricing

puzzle 170▶ ~10 min

Black-Scholes×Closed-form European pricing

Option pricing

puzzle 178▶ ~10 min

Hill climbing×Random restarts

Local optimization

puzzle 183▶ ~10 min

Round-robin scheduling×Time quantum

CPU scheduling

puzzle 185▶ ~10 min

Matrix exponentiation×Binary exponentiation

Linear recurrence evaluation

puzzle 186▶ ~12 min

Ski rental×Break-even deterministic rule

Rent-or-buy decisions

puzzle 188▶ ~10 min

2-opt×Edge-uncrossing swaps

Tour improvement

puzzle 189▶ ~10 min

Vickrey auction×Second-price rule

Truthful single-item auction

puzzle 204▶ ~11 min

Greedy vertex cover×Maximal matching

Vertex cover 2-approximation

Search, Constraints & Games

Strings & Text

Computational Geometry & Topology

Numerical & Scientific Computing

Signal, Image & Graphics

Machine Learning & AI

Probabilistic, Randomized & Simulation

Cryptography & Number Theory

Information Theory & Coding

Systems & Networking

Databases & Information Retrieval

Formal Languages & Compilers

Quantum & Unconventional Computing

Computational Biology & Chemistry

Robotics, Control & Planning

read or listen

Each lesson has a written explanation and a spoken version. Open a lesson and use its Listen or Text Narration control. Recorded lessons offer two voices; earlier lessons use the voices available in your browser.

Listening requires no account. Choose a voice and pace in the player. The legacy lessons keep their existing recordings and playback controls.