A deterministic card table

Eight Perfect Shuffles

A perfect out-shuffle is the opposite of random: it sends every position through a fixed doubling rule. Shuffle the live deck and watch all 52 cards return after eight exact out-shuffles, trace any card through the formula, then use binary in/out instructions to steer the top card to any requested position. A 24-card packet exposes the deeper surprise and a correction: its out-shuffle returns after 11, while the much larger group generated by both perfect shuffles is a cited theorem whose order arithmetic is checked live.

I · The returnCut exactly. Interlace exactly.

An out-shuffle splits the deck in half and alternates the cards while leaving the top and bottom cards outside the weave. Press once. The colors are original positions, so the interlacing is visible before the labels are readable.

Label positions from the top, starting at zero. For every card except the bottom one, the out-shuffle is multiplication by two modulo one less than the deck size. The bottom card is fixed separately. Repeating the shuffle repeats the multiplication. The deck returns when a power of two first leaves every position unchanged.

The in-shuffle changes which half contributes first. Its clean coordinate is one more than the visible position, so the modulus becomes one more than the deck size. Switch the control above and the page rebuilds the whole permutation. The longer return is not animated by assertion. You can run it.

II · The steering wheelWrite the destination in binary

The obvious dismissal is that eight is a cute coincidence about one deck size. Alex Elmsley's deeper observation turns the same doubling into control. Read a target's binary digits from left to right. A one means in-shuffle. A zero means out-shuffle. Each move appends that digit to the tracked card's position.

This is not a shortcut that works for only the displayed target. The green audit line exhaustively constructs and simulates the binary instruction for every legal target whenever the page loads. The offline verifier independently shuffles complete arrays, then asks where the original top card landed.

III · The exceptional packetTwenty-four cards do something else

The group generated by both perfect shuffles is much richer than the return time of either generator. A 24-card packet is an exceptional case in the classification by Persi Diaconis, Ronald Graham, and William Kantor. First, test the packet's plain out-shuffle.

Now add the in-shuffle and consider every arrangement reachable by any finite word in the two moves. That set is the shuffle group. Diaconis, Graham, and Kantor identify the 24-card case as a semidirect product involving the sporadic simple Mathieu group M12. The identification is their theorem. The live arithmetic below checks the resulting order, not the theorem that names the group.