An Application of Markov chain: Card shuffling and measuring the randomness of a deck
We investigate the card shuffling problem from a simulation-based approach. We first create a randomness measure for gauging how well-shuffled a deck is. Several hundred thousand random decks are generated to simulate the distribution of the randomness measures of well-shuffled decks. Then we examine the number of shuffles a certain shuffling scheme would take to reach the mean of this simulated distribution.