On the Asymptotic Solution of a Card-Matching Problem
From MaRDI portal
Recommendations
- What to expect in a game of memory
- Riffle shuffles of decks with repeated cards
- A better way to deal the cards
- scientific article; zbMATH DE number 4066897
- On Duality of Probabilities For Card Dealing
- A simple card guessing game revisited
- Bar bets and generating functions: the distribution of the separation of two distinct card ranks
- scientific article; zbMATH DE number 35072
- How many times are needed for card shuffling?
Cited in
(13)- scientific article; zbMATH DE number 3978871 (Why is no real title available?)
- scientific article; zbMATH DE number 4066897 (Why is no real title available?)
- Matching the finitized Poisson distribution to the matching distributions
- On Duality of Probabilities For Card Dealing
- The n-card problem, stochastic matrices, and the extreme principle
- Bar bets and generating functions: the distribution of the separation of two distinct card ranks
- More Efficient Match-Making and Satisfiability The Five Card Trick
- What to expect in a game of memory
- How to play Dundee.
- A generalised matching distribution for the problem of coincidences
- Convergence of unforced errors in the matching problem
- A Bayesian analysis of the matching problem
- An analysis of the last round matching problem
This page was built for publication: On the Asymptotic Solution of a Card-Matching Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891778)
