Matrix Multiplication, Three Arithmetics
Click any entry of a matrix product and see its candidates — under ordinary, min-plus, and max-plus arithmetic.
Each artifact here is a self-contained static page that works offline and is independently archivable — a landing page explains the idea, and a full-screen explorer runs the interactive application. Some explainers form a series that reads in order (each page carries Previous/Next links); others stand alone. Filter by topic using the tags in the sidebar.
The first series builds from the arithmetic up — begin with how the product of two matrices changes when you swap the arithmetic:
Click any entry of a matrix product and watch its candidates resolve — under ordinary, min-plus, and max-plus arithmetic. One winning term becomes a witness: the cheapest stop, or the binding constraint. It’s the foundation the rest of the series builds on.

A five-part mini-course tracing a single idea — replacing ordinary addition with min or max — from arithmetic, to algorithms, to hardware, to cycles. Read in order:
O(n³) route to the closure W*.The cards below are in the same order; each page also carries Previous/Next links.