When you shuffle a deck of cards, you may feel you are creating an entirely random order, but it isn’t as simple as that. Behind this seemingly ordinary act lies a captivating mathematical reality. Mathematicians have studied the ways of shuffling in detail. Their discoveries reveal astonishing secrets.
The Challenge of Random Shuffling
A standard deck comprises 52 cards, and the number of permutations (or arrangements) is astronomical. To be precise, there are about 8×10^67 different ways to order these cards—a number so vast that it far exceeds the age of the Universe, even if you used a supercomputer to generate them.
Yet, despite these infinite possibilities, when you shuffle your cards you may well notice certain familiar sequences repeating themselves. In other words, although the shuffle is theoretically random, in practice it is not always. This happens because insufficient shuffling can create patterns rather than truly redistributing the cards in a random manner.
Different Shuffling Techniques
There are several methods to shuffle a deck. One of the most common is the hand shuffle, which you have surely tried. In this method, you split the deck into small piles and interleave them gradually. It is a shuffle that may seem effective, but in fact it is not mathematically optimal. According to Johan Jonasson, a professor of probability analysis, a hand shuffle can require thousands of repetitions to yield a result that is roughly random.
Another popular method is the riffle shuffle, where you split the deck into two halves and weave them together, the cards overlapping in a back-and-forth motion. This method is more efficient than the hand shuffle. In fact, it is used in casinos and card competitions precisely because it is closer to true randomness.
The Science Behind the Riffle Shuffle
In 1990, two mathematicians, Dave Bayer and Persi Diaconis, conducted an in-depth study of card shuffling. They demonstrated the exact number of riffle shuffles required for the cards to be sufficiently mixed to resemble a random order, a calculation grounded in the mathematics of probability.
The distance to randomness is a fundamental concept for understanding how well a deck is shuffled. It measures how close a deck is to a truly random order. In other words, this distance gauges how much a deck, after a given number of shuffles, resembles a completely unpredictable distribution of the cards.
The idea is that even after several shuffles, a deck can still exhibit patterns or regularities. For example, the cards can appear in a sequence that is more predictable than a genuine random shuffle. The distance to randomness quantifies this predictability. The smaller this distance, the more randomly distributed the cards are.
So, how many shuffles are needed? Through intricate analysis and computer simulations, mathematicians determined that after about seven shuffles, this distance to randomness becomes small enough that the deck is almost as random as it can be. In other words, after seven shuffles, the cards are redistributed in such a way that it becomes extremely difficult, or even impossible, to predict their order.
But beware, shuffling even more doesn’t really offer benefits. Bayer and Diaconis observed that beyond seven shuffles, the cards do not become any more random and can even return to a more ordered arrangement. For example, after eight shuffles, you might find a layout close to that of a perfect shuffle.
