When is a deck of cards well shuffled?

Bachelor thesis (2018)

Authors

R. Tebbens Electrical Engineering, Mathematics and Computer Science

Contributors

Mathijs Joosten (mentor)
M.C. Veraar Analysis - EEMCS (mentor)
B. van den Dries Analysis - EEMCS (mentor)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2018 Ricardo Tebbens
More Info
expand_more

Published Date

15-08-2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

When is a deck of cards shuffled good enough? We have to perform seven Riffle Shuffles to randomize a deck of 52 cards. The mathematics used to calculate this, has some strong connections with permutations, rising sequences and the L1 metric: the variation distance. If we combine these factors, we can get an expression of how good a way of shuffling is in randomizing a deck. We say a deck is randomized, when every possible order of the cards is equally likely. This gives us the cut-off result of seven shuffles. Furthermore, this gives us a window to look at other ways of shuffling, some even used in casinos. It turns out that some of these methods are not randomizing a deck enough. We can also use Markov chains in order to see how we randomize cards by ”washing” them over a table.