Add chips to a graph — when a node overflows it fires to neighbors, producing a toppling wave
Click a node to add chips and trigger toppling. Watch waves cascade through the graph.
Chip-firing game (Björner, Lovász, Shor 1991): Each node v has chips[v] chips. A node fires when chips[v] ≥ deg(v): it sends one chip to each neighbor. The abelian property: the final stable configuration is independent of firing order — only which nodes fire and how many times depends on order. On graphs with a sink (absorbing node), always terminates. The chip-firing group is isomorphic to the Jacobian (Picard group) of the graph — deep connection to algebraic geometry. Click nodes to add chips.