Algorithm Timers

Visual countdowns built on real algorithms — cellular growth, fractal aggregation, percolation, path-filling, and packing. Each fills the screen exactly when time runs out, but the pattern is different every run.

Spread Timer

Stochastic infection model — three to five random seed cells spread outward each step, producing organic blob shapes. Inspired by epidemic and percolation simulations.

Blocks Timer

Pre-planned tetromino packing — a backtracking solver finds a layout that fills the board with no gaps, then drops the pieces along that plan. Every reset finds a different valid tiling.

Maze Timer

A snake winds through a Hamiltonian path that visits every cell exactly once. Built from a uniformly random spanning tree on 2×2 blocks — twisty, never wall-hugging, never the same twice.

Coral Timer

Diffusion-limited aggregation from a single centre seed. Particles random-walk until they stick to the cluster — the same physical mechanism behind real coral, mineral dendrites, and lightning.

Lichen Timer

Eden growth model from a handful of random seeds. Each step picks a uniformly random cell on the cluster boundary and adds it — produces soft, lumpy blobs rather than fractal spines.

Forest Fire Timer

Percolation-style spread from a single lightning strike. A burning band moves across the screen and leaves a trail of char behind — a stochastic front-propagation simulation.

Frost Timer

Eden growth seeded from the entire perimeter (in random order). Ice creeps inward from every edge of the screen until the centre is the last to freeze over.

What Are Algorithm Timers?

These timers are different from normal visual countdowns. Instead of animating a fixed shape — a bar shrinking, a clock-hand sweeping, sand pouring through a fixed hourglass — each one is driven by a real algorithm that produces a different visual every run. The pattern at the end is the same kind of thing every time (a coral, a maze, a packed wall of blocks), but the specific shape is always new.

Most of them work the same way under the hood: the algorithm precomputes an order to fill cells (or place pieces) in, and the timer renders the first N of those cells where N grows from zero to total as time runs out. The interesting part is the order — that's where DLA, Eden growth, percolation, and Hamiltonian cycles come in.

Why Use One?

Perfect For

The Algorithms, Briefly

Contact Us