Re: Card dealing and random repetition
- From: "toby" <toby@xxxxxxxxxxxxxxxxxxx>
- Date: 31 Mar 2006 10:09:41 -0800
pete wrote:
Gerry Quinn wrote:
In article <%0AVf.32718$nz4.4826@xxxxxxxxxxxxxxxxxxxxx>,
simaldeff@xxxxxxxxx says...
I though about something while reading your post.
Have you ever seen someone shuffle a deck? ...
I think this method looks funnier. Could it have any utility? It's a
direct emulation of the real-world card shuffling.
But mainly it emulates the defects of real-world card shuffling. A
perfect shuffle has no structure of the kind you describe.
"A perfect shuffle" sounds like
it would be a bad thing in a card game.
Unless you are concerned about players exploiting its
defects/structure/non-randomness. See Knuth's TAOCP Vol. 2 anecdotes
about the "Super-random" number generator and card shuffling: "A
moment's reflection is enough to convince oneself that the approaches
people traditionally use to shuffle cards are miserably inadequate;
there is no hope of obtaining each of the t! permutations with anywhere
near equal probability by such methods. It has been said that expert
bridge players make use of this fact when deciding whether or not to
'finesse.'" He then introduces the (well known) shuffle attributed to
Moses and Oakford (1963).
--
pete
.
- References:
- Re: Card dealing and random repetition
- From: Simaldeff Blaldieri
- Re: Card dealing and random repetition
- From: Gerry Quinn
- Re: Card dealing and random repetition
- From: pete
- Re: Card dealing and random repetition
- Prev by Date: Re: returning lvalue in C vs C++
- Next by Date: Re: Card dealing and random repetition
- Previous by thread: Re: Card dealing and random repetition
- Next by thread: Re: Card dealing and random repetition
- Index(es):