Card rules · 2026-10-29
A Simple Cut Preserves the Order Inside Each Block
Take the five-card sequence A, B, C, D, E. Cut after C and place the lower block above the upper block. The result is D, E, A, B, C. This simple cut moves two intact blocks without…
Take the five-card sequence A, B, C, D, E. Cut after C and place the lower block above the upper block. The result is D, E, A, B, C. This simple cut moves two intact blocks without rearranging the cards inside either block.
What changed?
The starting point changed. D is now first, and C is last. Within each block, however, the order stayed intact: D still precedes E, while A still precedes B and C.
What did not happen?
The cards were not freely rearranged. A result such as D, B, E, A, C cannot be produced by this specified cut alone. It would require a different operation or an additional rearrangement.
When describing deck preparation, name the operation instead of using “cut” and “shuffle” as interchangeable words. A cut can be one step in a larger preparation process, but this example establishes only the effect of swapping two intact blocks.
Undo the cut with the block boundary
Starting from D, E, A, B, C, cut after E and put the lower block first. The sequence returns to A, B, C, D, E. This reversibility is a feature of the specified block exchange. It does not reveal whether an earlier shuffle occurred. Reconstructing one visible operation cannot establish the entire preparation history.