How many shuffles does it take to randomize a deck of cards?<\/p>\n\n\n\n
The answer, of course, depends on what kind of shuffle you consider. Two popular kinds of shuffles are the random riffle shuffle and the overhand shuffle. The random riffle shuffle is modeled by cutting the deck binomially and dropping cards one-by-one from either half of the deck with probability proportional to the current sizes of the deck halves.<\/p>\n\n\n\n
In 1992, Bayer and Diaconis showed that after seven random riffle shuffles of a deck of 52 cards, every configuration is nearly equally likely. Shuffling more than this does not significantly increase the “randomness”; shuffle less than this and the deck is “far” from random.<\/p>\n\n\n\n
In fact, it is possible to show that five shuffles are not enough to bring about the reversal of a deck—see Rising Sequences in Card Shuffling. So it is somewhat surprising that just two shuffles later, every configuration is possible and nearly equally likely.<\/p>\n\n\n\n
By the way, the overhand shuffle is a really bad way to mix cards: it takes about 2500 overhand shuffles to randomize a deck of 52 cards!<\/p>\n\n\n\n
Presentation Suggestions:<\/strong> The\u00a0Math\u00a0Behind\u00a0the\u00a0Fact:<\/strong> There are, of course, non-random shuffles: see\u00a0Perfect Shuffles.<\/p>\n\n\n\n How to Cite this Page:<\/strong> References:<\/strong> Fun Fact suggested by: <\/strong> How many shuffles does it take to randomize a deck of cards? The answer, of course, depends on what kind...<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"tags":[20,160,9,4,169,45],"class_list":["post-379","page","type-page","status-publish","hentry","tag-analysis","tag-card-shuffling","tag-combinatorics","tag-medium","tag-patterns","tag-probability"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/379","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/comments?post=379"}],"version-history":[{"count":3,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/379\/revisions"}],"predecessor-version":[{"id":1621,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/379\/revisions\/1621"}],"wp:attachment":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/media?parent=379"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/tags?post=379"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Bring a deck of cards in and demonstrate how non-random just 2 or 3 shuffles are by ordering the deck and then letting someone shuffle. There will still be discernible patterns after a small number of shuffles!<\/p>\n\n\n\n
A well-written account of Bayer and Diaconis’ result may be found in the Mann reference. There are many ideas in this result. Analysis of the “distance from randomness” requires the choice of a metric between probabilities.\u00a0Combinatorics\u00a0and\u00a0probability\u00a0intertwine in the analysis of\u00a0rising sequences generated after a certain number of shuffles, which is an important part of proving this result.<\/p>\n\n\n\n
Su, Francis E., et al. “Seven Shuffles.” Math Fun Facts<\/em>. <http:\/\/www.math.hmc.edu\/funfacts>.<\/p>\n\n\n\n
Brad Mann, “How many times should you shuffle a deck of cards?” UMAP J.<\/em> 15 (1994), no. 4, 303–332.
Dave Bayer and Persi Diaconis, “Trailing the dovetail shuffle to its lair”,
Ann. Appl. Probab.<\/em> 2(1992), no. 2, 294–313.<\/p>\n\n\n\n
Brad Mann <\/p>\n","protected":false},"excerpt":{"rendered":"