TOPICS
Search

Exchange Shuffle


An exchange shuffle is a shuffle of a deck of cards obtained by successively exchanging the cards in position 1, 2, ..., n with cards in randomly chosen positions. Unlike the Fisher-Yates shuffle, the exchange shuffle chooses the second position from the entire deck at every step and does not in general produce a uniform random permutation. For 4<=n<=17, the most frequent permutation is (n,...,m+1)(m,...,1), where m=n/2 if n is even and either (n-1)/2 or (n+1)/2 if n is odd (Goldstein and Moews 2003). Amazingly, for n>=18 cards, the identity permutation (i.e., the original state before the cards were shuffled) is the most likely (Goldstein and Moews 2003).


See also

Fisher-Yates Shuffle, Riffle Shuffle, Shuffle

Explore with Wolfram|Alpha

References

Goldstein, D. and Moews, D. "The Identity Is the Most Likely Exchange Shuffle for Large n." Aeq. Math. 65, 3-30, 2003. https://doi.org/10.1007/s000100300001.Robbins, D. P. and Bolker, E. D. "The Bias of Three Pseudo-Random Shuffles." Aeq. Math. 22, 268-292, 1981. https://doi.org/10.1007/BF02190184.Schmidt, F. and Simion, R. "Card Shuffling and a Transformation on S_n." Aeq. Math. 44, 11-34, 1992. https://doi.org/10.1007/BF01834201.

Referenced on Wolfram|Alpha

Exchange Shuffle

Cite this as:

Weisstein, Eric W. "Exchange Shuffle." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ExchangeShuffle.html

Subject classifications