Adjacency Matrix
A square matrix of cells is read by a head running the main diagonal, each row lighting its entries together with their mirrored partners below the diagonal.
A square matrix of cells is read by a head running the main diagonal, each row lighting its entries together with their mirrored partners below the diagonal.
A lattice of dots carries a breadth-first frontier outward from a source, each ring lighting as the wave reaches it and dimming to a settled visited state behind it.
A closed one-stroke walk over the complete graph on five vertices, a traced arc running the circuit and using every edge exactly once before it closes.
Four concentric code tracks carry the bits of a reflected binary word and click round one sector at a time under a fixed reader, exactly one track changing at each step.
A row of frequency bars sends its two lightest subtrees up to join at a parent node, the prefix code tree assembling upward in merge order.
A Young diagram of unit cells reshapes as a single block leaves the end of the longest row and lands at the end of the shortest, the total staying fixed.
A grid of streets carries a monotone staircase path from corner to corner that re-routes between three alternatives, each staying below the diagonal.
A row of tally columns whose heights satisfy a two-term recurrence: a span bracket steps right across the last two and the next column rises to their sum.
A bundle of capacity pipes runs from a source rail to a sink rail carrying dashed flow, the saturated pipes held brighter while a minimum-cut rule returns to the narrowest crossing.
A triangular array of cells in which each adjacent pair slides together into the cell beneath it, the summing wave descending the triangle row by row.
Six lanes are crossed by a chain of transpositions and the strands re-draw left to right behind a wipe front, resolving into the permutation the network composes.
A tiling of distorted quadrilaterals settles into a proper two-tone colouring, the regions taking their tone column by column so no two neighbours ever match.
Three pegs carry a graded stack of bars and the two upper discs replay the recursive transfer, one lifting clear and crossing to a new peg at a time.
Eight points joined by every chord, with one round of the edge colouring lit at a time as the perfect matching rotates through the seven-round draw.
A scatter of nodes sits under a faint web of candidate edges while the minimum spanning tree draws itself one cheapest edge at a time until every node is reached.