The Galton board
Every pin flips a coin. The ball’s number changes nothing.
Same balls. Ten buckets. One board leaves it to chance.
The other makes one choice, then asks a smaller question.
Every pin flips a coin. The ball’s number changes nothing.
Every pin decides: L / − or R / +. Same grid. A matching bucket.
Nine left-or-right bounces produce a binomial distribution: a discrete approximation to the familiar bell curve. The numbers stay mixed.
Left moves down the number scale; right moves up. Each decision narrows the reachable buckets, then asks the next pin. Nine choices leave one destination.
Your “beam search without the beam” intuition: commit locally and recurse. This grid illustrates binary recursive routing with overlapping reachable groups; a balanced classification tree can use fewer decisions.
Number finds X. Color finds Y. Gravity takes Z.
Every smart pin still makes just one binary choice.
Drag to turn, or choose a view below. Z always falls down ↓
Look along Y. All colors share each X bucket.
Look along X. All numbers share each Y bucket.
Every batch contains every pairing equally: ten numbers × ten colors. A red 7 and a violet 7 share X, but finish at different Y positions.
Pins alternate axes as Z increases downward. Nine X decisions sort by number; nine Y decisions sort by color. Eighteen binary choices find one of 100 buckets.
The sections are orthographic projections of the complete volume, with the other horizontal axis collapsed. The positions, colors, numbers, and timing are shared.