Galton Board Cipher — Probability and Bell Curves

1 2 3 4 5 6 7

difficulty levels — click green to claim

> GALTON BOARD CIPHER

galton difficulty: 3–6 field: probability / statistics

The idea in plain English: A Galton board is a vertical board with rows of pegs. Balls are dropped from the top. At each peg, the ball bounces left or right with equal probability. After enough rows, the balls collect in bins at the bottom, forming a bell curve (normal distribution). The number of balls in each bin follows a predictable pattern — the binomial distribution. In this puzzle, the heights of adjacent bins (differences in ball counts) encode ASCII codes. You compute the expected distribution, then read off the differences between pairs of bins as letters.

Why this really exists: The Galton board visualizes the Central Limit Theorem — one of the most important ideas in statistics. It explains why so many natural phenomena follow a bell curve: human heights, IQ scores, measurement errors, blood pressure. Sir Francis Galton (Charles Darwin's cousin) invented it in the 1800s. Quality control in manufacturing uses the same principle (Six Sigma). Insurance companies price policies based on normal distributions.

▸ Concrete Example

Board with 5 rows, 6 bins. Drop 100 balls. Expected counts:

Row 5 coefficients (binomial): 1, 5, 10, 10, 5, 1
Normalized to sum to 100: [3, 16, 31, 31, 16, 3]

Bin differences (adjacent):
|3-16| = 13 → CR
|16-31| = 15 → NO
etc.

Each bin difference maps to an ASCII code → build the word from adjacent pairs.

The puzzle provides simulated ball-drop data. The message is in how the balls are distributed.

▸ How to Decode (Step by Step)

1. Get the board dimensions (rows, bins, ball count) from puzzle data

2. Check expected bin counts for observation data or difference patterns

3. Read adjacent bin differences or bin-to-code mappings

4. Convert each value to ASCII → join → the answer word

# Expected distribution: Pascal's triangle row
import math
row = [math.comb(rows, k) for k in range(rows+1)]
total = sum(row)
expected = [c * ball_count / total for c in row]

diffs = [abs(int(bins[i]) - int(expected[i])) for i in range(len(bins))]
word = ''.join(chr(d) for d in diffs if 32 <= d <= 126)

▸ Real-World Applications

Quality control: Six Sigma monitoring uses bell curves to detect manufacturing defects
IQ and testing: Standardized tests are designed to produce normally distributed scores
Finance: Stock market returns are modeled using normal distributions (though real ones have "fat tails")
Medicine: Blood pressure, cholesterol, and thousands of biological measurements follow normal distributions

← Back to all ciphers