FARO SHUFFLE
Key Facts
Perfect Restoration
A Faro shuffle always returns a deck to its original order after a specific number of iterations
Two Types
In-shuffle: bottom card moves up. Out-shuffle: top and bottom cards stay in place
52-Card Standard
8 out-shuffles or 52 in-shuffles restore a standard 52-card deck
Magician's Tool
Can move any card to any position using binary sequences of shuffles
Introduction to Faro Shuffle
The Faro shuffle is a perfect riffle shuffle technique where a deck is split in half and the cards are perfectly interleaved one at a time from each half. Unlike random shuffles, it produces a completely predictable result every time.
Named after the card game Faro, a popular gambling game in the American Old West, this shuffle technique was essential for dealers who needed to split and recombine the deck precisely after each round.
Also known as the weave shuffle in Britain and the dovetail shuffle, the technique gets its name from the way cards interleave like interlocking fingers or a woven pattern.
Historical Discovery
First documented by magician John Maskelyne, though it was already in use by Faro dealers. Later research by mathematician and magician Persi Diaconis uncovered its earlier association with the game and revealed its remarkable mathematical properties.
Why It Matters
Unlike random shuffles, a perfect Faro shuffle always returns a deck to its original order after a specific number of iterations. This predictability makes it invaluable for card magic and mathematical research, while making it useless for actual card game randomization.
Deck Visualization
Controls
Stats
Mathematical Explanation
In-Shuffle
Cards from the second half are placed first, moving the original top card to the second position.
Out-Shuffle
Cards from the first half are placed first, keeping the top and bottom cards in their original positions.
The Formulas
In-Shuffle:
A deck of n cards returns to original order after k in-shuffles when:
This means finding the smallest k where 2^k leaves a remainder of 1 when divided by (n+1)
Out-Shuffle:
A deck of n cards returns to original order after k out-shuffles when:
This means finding the smallest k where 2^k leaves a remainder of 1 when divided by (n-1)
Standard 52-Card Deck
Requires only 8 out-shuffles or 52 in-shuffles to return to its original order.
Binary Card Positioning
Magician Alex Elmsley discovered you can move any card to any position by expressing the position in binary and performing in-shuffles for 1s and out-shuffles for 0s.
Example: Moving a card exactly 26 places in a 52-card deck
Position 26 in binary: 011010
This requires: Out-Out-In-Out-In-Out shuffles (reading right to left)
Why This Matters
The Faro shuffle demonstrates a fascinating intersection of combinatorics, group theory, and modular arithmetic. Each shuffle is a permutation, and repeated shuffles form a cyclic group. The restoration number is the order of this permutation in the symmetric group. This predictability makes it useless for randomization but invaluable for card magic and studying permutation properties.