Three Scoop Miracle

You shuffle a packet and remember its bottom card. You spell a flavour of ice cream three times, dealing one card per letter and dropping the rest on top. Your card has risen to the top.

You need: Thirteen cards and a sealed prediction
Principle: Count out and transfer

Watch the lectureLecture 40 · Three Scoop Miracle

First, be the spectator

Try it

You shuffle, you choose the flavour and you deal every card. The cards follow the real moves.

Try a different flavour first. The secret will keep.

The secret

Why it works

Every scoop is the same move, called a COAT: count out and transfer. Counting cards out one at a time reverses them, because each new card lands on top of the last; the first card dealt ends up at the bottom of the pile. The cards still in your hand keep their order and go on top. Lifting the same cards off in one block would be a cut, which is a different move with a different result.

So forget the faces and follow positions, numbered 1 at the top down to n at the bottom. Count out k cards. A card in position i that gets counted (i ≤ k) lands at position n + 1 − i. A card that stays in your hand (i > k) just moves up k places, to i − k.

Now follow your card. It starts at the bottom, in position n. The first scoop leaves it in your hand, so it rises to n − k. If k is at least half the packet, that position is among the next k counted, so the second scoop sends it to n + 1 − (n − k) = k + 1: one place past the counted cards. The third scoop lifts it k places, to position 1. With thirteen cards and chocolate (9 letters), the route is 13 → 4 → 10 → 1. (If you count the whole packet, k = n, every card is counted every time: each scoop simply reverses the packet, your card goes n → 1 → n → 1, and three reversals do the same as one.)

The same reasoning works for the whole packet at once. Split it into three blocks: the top n − k cards (call them T), the bottom n − k cards (B), and the 2k − n cards between them (M). Every count of k cards covers exactly two neighbouring blocks, so no block is ever split; blocks only move and turn around. Below, a small R marks a block in reverse order, so M^R is M read backwards.

Because k is at least half the packet, every count ends exactly on a block boundary, so three scoops carry the bottom block to the top, reversed, with your card at its head.

Notice the row labelled After 3, then make a fourth scoop. It counts B^R and M^R together and reverses them back into M B, with T on top: every card is home. That holds for every count of at least half the packet, and it is the starting point of the challenge.

Test your understanding

Challenge

With a count of at least half the packet, four equal scoops always bring every card home. Predict when one marked card is first home, and when the whole packet is, then step through to check.

Take it to the table

Perform it yourself

Set-up

Thirteen different cards. Any thirteen will do.
A prediction, written in advance and sealed: Your remembered card will finish on top. It names a position, not a card, so you never need to peek.
A printed menu: VANILLA (7 letters), CHOCOLATE (9), STRAWBERRY (10). With thirteen cards any count from 7 to 13 works; these three make the menu.
A few spare cards for demonstrating the move.

Performance

Put the sealed prediction on the table. Hand the packet to your spectator and let them shuffle freely.
They square the packet and, without changing the order, look at the bottom card and remember it. They put the packet down face down. From now on there is no shuffling and no cutting.
They choose a flavour. They will spell it three times, always the same flavour.
Show the move with the spare cards: deal one card face down onto the table for each letter, each card landing on the one before. When the word ends, put all the cards still in your hand on top of the pile and pick the packet up. That is one scoop.
The spectator does the first scoop with the real packet, slowly, so that one letter always means one card. You watch, but you never touch the packet.
Second scoop, same flavour. Third scoop, same flavour. They square the packet and leave it on the table. No final cut.
Open the prediction. Ask them to name their card, then to turn over the top card.

Handling notes

Cards are counted out one at a time, never lifted as a block. Lifting nine cards together and putting them under the rest is a cut, not a scoop, and the guarantee does not cover it.
Keep the count the same for all three scoops. Changing it halfway is a different procedure.
If someone miscounts or adds a cut, say so openly, put the remembered card back on the bottom and do all three scoops again.
If someone asks for a flavour that is not on the menu: “Choose one of our three printed counts for this packet; we can design other menus later.”
Always ask for the card’s name. The method never needs you to know it.
To design your own menu: a word with k letters works for any packet of k to 2k cards. Count letters only, with no spaces or punctuation.

Further

Going deeper

A count is not a cut

Take eight cards labelled 1 to 8 and count out five. The dealt pile reads 5 4 3 2 1 from the top, and the remainder 6 7 8 goes on top: 6 7 8 5 4 3 2 1. A cut of five gives 6 7 8 1 2 3 4 5 instead. The tops agree; the order underneath does not, and that reversed order underneath is what makes the trick work.

Four scoops restore the whole packet

After three scoops the packet reads B^R M^R T. A fourth scoop counts B^R and M^R (together exactly k cards) and reverses them into M B, with T on top. That is T M B, every card in its original place and order. Writing F for one scoop, F⁴ is the identity, for any starting order.

That does not make four the first return. Following positions as cycles (old position → new position) for ten cards counted seven at a time gives (1 10 3 8)(2 9)(4 7)(5 6): the four cards on (1 10 3 8) need four scoops, and the six on the two-cycles need two. Every cycle length divides 4, so it is 1, 2 or 4; a three-cycle cannot occur. With an odd packet the centre never moves at all: for 13 cards, position 7 maps to 14 − 7 = 7 under every covered count. The next trick, The Middle Card, is built on that fixed point.

For the whole packet, here is a fact you can check in the challenge, for a count of at least half the packet. After two scoops the packet reads T^R M B^R, which equals T M B only when T and B have at most one card: k = n − 1 or k = n (and those two counts are in fact the same move, a full reversal). In every other case two scoops are not enough, one scoop never is (for two or more cards), and the first return divides 4, so it is exactly 4.

Below half, none of this is promised: three cards counted one at a time need three scoops to come home, and seven cards counted two at a time need twelve.

Below half, the guarantee is gone

With ten cards and a count of four, the middle block would need 2 × 4 − 10 = −2 cards, so the block proof does not apply. A direct check: the bottom card travels 10 → 6 → 2 → 9 and does not finish on top. The full orders are

1 2 3 4 5 6 7 8 9 10 → 5 6 7 8 9 10 4 3 2 1 → 9 10 4 3 2 1 8 7 6 5 → 2 1 8 7 6 5 3 4 10 9.

One verified failure is enough to show that the guarantee cannot be stretched to every smaller count. It does not show that every smaller count fails: a few lucky cases still bring the bottom card up, but nothing promises it.

At the other end, counting the whole packet (k = n) reverses it each time. Three reversals equal one, so the bottom card still reaches the top, though the effect looks less mysterious.

Sources

Colm Mulcahy, Mathematical Card Magic: Fifty-Two New Effects (CRC Press, 2013), Chapter A, printed pp. 25–27 and 30–42: Low-Down Triple Dealing, its Three Scoop Miracle presentation, and the four-transfer restoration. The ice-cream menu, the worked examples and the challenges on this page are teaching adaptations from the course scripts (episodes 40–42).

Mulcahy performs the effect with Matt Parker in Stand-up Maths’ Quick mathematical card trick, and discusses the family in his Bridges 2018 paper.