How Many Shuffles Until It's Random?

It sounds like the kind of question with no clean answer — random is a slippery word, a deck is a deck, surely it just gets gradually more jumbled. But the question has a precise answer, it is one of the prettiest results in modern probability, and it is not what intuition guesses. The randomization does not creep in. It arrives suddenly.

To ask it properly we need to pin down two things: what a shuffle is, and what random means.

The shuffle first. When you riffle a deck (the casino calls it a dovetail) you cut it roughly in half and let the two halves fall back together in a rough interleave. Gilbert and Shannon's work, reported by Gilbert in 1955, and Reeds's independent work in 1981 gave the natural mathematical idealization, now called the GSR model: cut the deck into a top packet and a bottom packet, where the size of the cut is as random as flipping a coin for each card; then drop cards one at a time from the bottoms of the two packets, each drop favouring the larger packet in exact proportion to its size. That single rule reproduces the statistics of real human riffles remarkably well (Diaconis has the video and the data), and it has a magical property we will lean on hard: shuffles multiply. A GSR riffle is what's called a 2-shuffle (the deck is cut into 2 packets); do it again and the composition is exactly a 4-shuffle; k riffles in a row is precisely one 2^k-shuffle. We will get the whole answer out of that.

Now random. There are 52! possible orderings (a number near 8×10⁶⁷, more than the estimated atoms in our galaxy). A perfectly shuffled deck is one where all 52! orders are equally likely. After a finite number of riffles they are not equally likely: some orders are more probable than others, because the shuffle can't undo every pattern at once. So we measure how far the real distribution is from the perfect one. The standard yardstick is total-variation distance: across all sets of possible orders, the largest gap in probability between "the deck as it actually is" and "a perfectly random deck." It runs from 1 (a dead giveaway: you could win a bet about the order) down to 0 (truly indistinguishable from random). The question "how many shuffles?" becomes: how many riffles drive that distance down to near zero?

I · The shuffle, and the mark it leaves

Watch a deck shuffle. Below, the 52 cards are drawn as a strip coloured by their starting position — a smooth gradient from one end to the other, so order is something you can see. Riffle it and the gradient breaks into two interleaved combs; riffle again and the combs break into finer ones. The eye loses the pattern fast — but the deck does not. It carries a hidden fingerprint.

The fingerprint is the number of rising sequences. Pick up the shuffled deck and find where card 1 sits, then card 2, then 3: every time the next card is somewhere after the last, you're still in the same rising run; when it jumps backward, a new run begins. A fresh deck is a single rising sequence. Here is the key fact, and the whole reason this problem is solvable: one riffle can at most double the number of rising sequences. So after k shuffles there are at most 2^k of them: one shuffle, at most 2; seven shuffles, at most 128. The fingerprint helps estimate your shuffles. Bayer and Diaconis titled their paper, perfectly, "Trailing the dovetail shuffle to its lair."

That last clause is the hinge of everything. While the deck is under-shuffled, the rising-sequence count is small and revealing; as shuffling continues, its distribution approaches that of a uniform deck. A single near-average count does not certify randomness. The distance-to-random measures the gap between the whole distributions.

II · The exact distance, and the cliff

Here is the theorem that closes the problem. Bayer and Diaconis (1992) proved that after a 2^k-shuffle, the probability of ending in a particular order depends on nothing about that order except its number of rising sequences r:

P(order) = C(2^k + 52 − r,  52) / 2^52k

Every order with the same number of rising sequences is exactly equally likely; orders with more rising sequences are rarer. Count how many orders have each value of r — those counts are the famous Eulerian numbers — and you can sum up the total-variation distance to the perfect deck exactly. No simulation, no approximation: a finite sum of whole-number ratios. The integers involved are enormous (52! has 68 digits; 2^52·10 has 157), so the instrument below carries them in exact BigInt arithmetic and only rounds at the very last step — the same computation as the offline proof, reproducing the canonical table digit for digit.

Read the distances across the shuffle counts, then move the deck-size slider to recompute the curve. The shape of the answer jumps out.

This shape has a name: the cutoff phenomenon. The distance does not decay smoothly; it stays near its maximum, then collapses through a narrow window. From five to seven riffles, the distance drops from about 0.924 to 0.334, crossing this page's chosen one-half threshold while leaving detectable bias. Aldous and Diaconis found this same abrupt-transition behaviour across a whole family of shuffles and walks in the 1980s; the riffle is its most famous instance. The threshold gives us a stopping point, and the cliff makes the approach to it striking.

Why seven, specifically? Read it off the curve. This page chooses total-variation distance below one-half as its stopping point. The distance is still essentially 1 through four shuffles; it is 0.924 at five, 0.614 at six, and at seven it finally falls under a half, to 0.334. Each further shuffle then roughly halves it: 0.167, 0.085, 0.043. Seven crosses our threshold, but some bets still have a substantial advantage: Levin, Peres and Wilmer describe a solitaire game with win probability about 0.801 after seven GSR riffles, versus 0.5 for a uniform deck. Their textbook uses one-quarter as its default mixing-time tolerance, which this deck reaches at eight. Seven is the number Diaconis gave, and it is why a 1990 New York Times story ran under the headline that seven is the magic number for a deck of cards.

III · Reading the fingerprint back

If a shuffled deck still carries the mark of how many times it was riffled, then in principle you can read that mark: guess the number of shuffles from the order alone. That is the "lair" in Bayer and Diaconis's title. The instrument below hands you a deck riffled a hidden number of times; it counts the rising sequences and asks the maximum-likelihood question: for which shuffle-count is this many rising sequences most probable? Early on, the fingerprint is informative, but the guess can still miss. As the distributions approach uniform, the counts become harder to separate. Estimating a shuffle count is a different task from testing uniformity. An incorrect guess does not establish that the deck is mixed.

It is worth saying what this does and does not claim. It is about the riffle, idealized as GSR. Other shuffles are not so kind: the overhand shuffle (sliding small packets off the top) is dramatically worse, needing thousands of repetitions to mix a deck, because each pass moves so little. Our one-half threshold is a choice; a casino or a cryptographer might want the distance far smaller. Practice depends on the method: Kolata's 1990 report described four to seven shuffles in Las Vegas, while Diaconis's 2003 survey describes a shelf-shuffler operation that is not repeated. Those are dated descriptions of different methods; a machine pass need not be a GSR riffle. The clean, citable, beautiful fact is the one drawn above: for the riffle, the distance from uniform stays near one through four shuffles and drops below one-half at seven, with bias still remaining. The going is a cliff, not a slope.

The two edges that bind this place: every factual claim is checked, and every model is named a model. The shuffle here is the Gilbert–Shannon–Reeds idealization of a riffle, a model chosen because it matches measured human shuffles well (Bayer–Diaconis 1992) and because it makes the problem exactly solvable; it is not a claim that every hand riffles identically. The distance values (1.000, 1.000, 1.000, 1.000, 0.924, 0.614, 0.334, 0.167, 0.085, 0.043) are rounded total-variation distances, recomputed in front of you with BigInt arithmetic and re-derived offline to the last displayed digit in /research/seven-shuffles/verify.mjs (24/24 checks, including the published Bayer–Diaconis table, the GSR shuffle against its exact law, and the rising-sequence counter against the Eulerian numbers). "Seven" is the first shuffle whose distance falls below one-half; the asymptotic cutoff center is (3/2)·log₂52 ≈ 8.55.