Buffon's Needle
An 18th-century puzzle — drop a needle onto lined paper and count how often it crosses a line — that turns into a working, if slow, physical method for estimating pi from probability.
Prerequisites: Geometric Probability Puzzles, The Uniform Distribution
Rule a sheet of paper with parallel lines spaced distance apart. Drop a needle of length onto it at a random position and angle. What's the probability the needle crosses one of the lines? The famous, almost eerie answer — the probability involves — means you can flip this around and estimate just by dropping needles and counting crossings, no circle or diameter in sight.
Setting up the randomness
Two independent random quantities describe where the needle lands: , the distance from the needle's center to the nearest line (uniform between and ), and , the angle the needle makes with the lines (uniform between and by symmetry — steeper or shallower doesn't matter, only the acute angle to the lines does). Geometrically, the needle crosses the nearest line exactly when its half-length's vertical reach, , exceeds the distance to that line: the crossing condition is .
Turning geometry into a probability
For a fixed angle , the chance of crossing is the fraction of the -range, , that satisfies : that's . Averaging this over all equally likely angles from to (integrating and dividing by the range) gives the overall crossing probability:
In plain English: the probability of a crossing is proportional to how long the needle is relative to the line spacing, scaled down by a factor of — and that enters purely because averaging over a range of angles brings in circular geometry, even though nothing about the setup looks like a circle.
Worked example: estimating from a simulated drop count
Suppose (needle length equals line spacing) and you simulate 1,000 drops, observing 637 crossings. Rearranging the formula, . That's within 0.05% of the true value of , from nothing more than a crossing count — a genuine, if statistically noisy, Monte Carlo estimator for , converging slowly (error shrinks like ) but converging nonetheless.
Worked example: the case
If the needle is half the line spacing, , : . So a shorter needle relative to the spacing crosses lines less often, exactly as the geometry suggests — it has less reach to cross a line from any given starting position.
What this means in practice
Buffon's needle is the historical ancestor of Monte Carlo estimation: instead of computing a quantity directly, you set up a random experiment whose success probability encodes the quantity, then estimate that probability by repeated sampling. That's the exact logic behind pricing path-dependent options or estimating tail risk today — simulate many random scenarios and let the observed frequency stand in for a probability or expectation that's too hard to compute in closed form.
For a needle of length dropped on lines spaced apart, the crossing probability is . Because appears in the formula, counting crossings over many drops gives a working (if slowly converging) Monte Carlo estimate of .
Related concepts
Practice in interviews
Further reading
- Feller, An Introduction to Probability Theory, vol. 1, ch. 1