# full_deck_simulation

full_deck_simulation, a Python code which simulates a process in which a random card is drawn from a deck of 52, and then replaced, continuing until every card has been seen at least once.

A New York artist carried out an equivalent project by wandering the streets and picking up single playing cards that had been thrown away. Once a full, though motley, deck had been collected, it was displayed in a gallery. (Of course, many of the collected cards were duplicates, and thus didn't make the show!)

This is a version of a well-known problem in probability known as "the coupon collector's problem".

### Languages:

full_deck_simulation is available in a MATLAB version and a Python version.

### Related Data and codes:

brownian_motion_simulation, a Python code which simulates Brownian motion in an M-dimensional region.

chuckaluck_simulation, a Python code which simulates the Chuck-a-Luck gambling game.

duel_simulation, a Python code which simulates N repetitions of a duel between two players, each of whom has a known firing accuracy.

fire_simulation, a Python code which simulates a forest fire over a rectangular array of trees, starting at a single random location.

snakes_and_ladders_simulation, a Python code which simulates the game of Snakes and Ladders.

truel_simulation, a Python code which simulates N repetitions of a duel between three players, each of whom has a known firing accuracy.

### Reference:

1. John D Cook,
Sampling with replacement until you've seen everything,
https://www.johndcook.com/blog/2022/05/14/exhaustive-sampling/
14 May 2022.
2. Herbert Wilf,
Some New Aspects of the Coupon Collector's Problem,
SIAM Review,
Volume 48, Number 3, September 2006, pages 549-565.

### Source Code:

Last revised on 06 July 2022.