Tuesday, November 29, 2022

How Many Times Do I Have to Shuffle one Deck?

1 (1)

What is surprising is that a mathematical analysis of this seemingly innocuous question is linked to a wide range of mathematical questions, and has been generalized in significant ways…

Introduction

A month ago, I was playing the card game Crazy Eights with one of my children. During the middle of one game, we went through the entire deck, so we shuffled the cards in the discard pile a few times and started playing again. Hmmm. The cards were still grouped too closely by suits; that is, in spite of the shuffles, we were still seeing long sequences of, say, clubs when drawing from the pile. The ordering from the first part of the game persisted after the shuffles; it would seem that the shuffles hadn’t affected the ordering of the deck as much as we wished.

This led me to wonder how many shuffles would be needed to give a good guarantee that the deck had been put in random order. Curiously, I soon came across an essay in Aigner and Ziegler’s wonderful book Proofs from the Book that addressed just this issue and that led me to a remarkable paper by Aldous and Diaconis that gives an answer to this question.

This column will explain a few of the techniques and results from that paper. What is surprising is that a mathematical analysis of this seemingly innocuous question is linked to a wide range of mathematical questions, in areas such as Lie algebras, Hochschild homology, and random walks on graphs, and has been generalized in significant ways.

Let’s begin by supposing that we have a deck of n cards; to keep things simple, we will assume that the cards are decorated only with the numbers1to n. Initially, the cards are in numerical order and we will shuffle them using some technique that we agree upon. The usual shuffle is called ariffle shuffle and will be discussed later. For now, we’ll begin with a simpler type of shuffle called the top-in-at-random shuffle. In this shuffle, we remove the top card from the deck and place it, with equal probability, in any of the n available positions.

For instance, with n=3, there are three possibilities, each of which is equally likely.

Let’s be quantitative about this shuffle. The set of all orderings of the deck will be denoted by Sn, which is often called the symmetric group onnletters. There are n! possible orderings. If π is a particular ordering of the deck, we will denote the probability that π is obtained after one shuffle byQ(π).Consider the example above in which n=3. If we write the ordering of the deck from left to right, we see that

π Q(π)
1 2 3 0.333
1 3 2 0.000
2 1 3 0.333
2 3 1 0.333
3 1 2 0.000
3 2 1 0.000

This shows that three of the six possible orderings are equally likely, and the other three are not at all possible. So we shuffle again … and again. The possible orderings of the deck are shown below after 1, 2, and 3 shuffles. For convenience, the cards are here represented by colors rather than numbered.

By Qk(π), we will mean the probability that the ordering π occurs after k shuffles. A little computation shows that

Q1(π) Q2(π) Q3(π) Q4(π) Q5(π) Q6(π) Q7(π) Q8(π) Q9(π) Q10(π)
1 2 3 0.333 0.222 0.185 0.173 0.169 0.167 0.167 0.167 0.167 0.167
1 3 2 0.000 0.111 0.148 0.160 0.165 0.166 0.166 0.167 0.167 0.167
2 1 3 0.333 0.222 0.185 0.173 0.169 0.167 0.167 0.167 0.167 0.167
2 3 1 0.333 0.222 0.185 0.173 0.169 0.167 0.167 0.167 0.167 0.167
3 1 2 0.000 0.111 0.148 0.160 0.165 0.166 0.166 0.167 0.167 0.167
3 2 1 0.000 0.111 0.148 0.160 0.165 0.166 0.166 0.167 0.167 0.167

Notice that as we perform more shuffles, the frequency with which we see the different orderings becomes more uniform. By U(π), we will denote the probability density in which each ordering π is equally likely; that is, U(π)=1/n! The results in the table above indicate that

QkUask.

To make this statement precise, and to faciliate a quantative analysis of shuffling, we need to introduce a notion of distance between probability densities. Therefore, suppose that Q1 and Q2 are two probability densities on Sn. First, we define the difference in Q1 and Q2 for A, a subset of Sn, by adding together the differences over all the elements of A:

Q1(A)Q2(A)=12πA|Q1(π)Q2(π)|

Then the distance between Q1 and Q2 is the maximum distance over all the subsets of Sn:

Q1Q2=maxASn|Q1(A)Q2(A)|

Note that this is a very sensitive measure of the distance between the two densities. First, notice that 0Q1Q21. Next, imagine that U, the uniform distribution on Sn, and Q is a density resulting from a particular type of shuffle. If this type of shuffle leaves a single card in its original place, then

QU=11n,

which is a rather large distance considering that the maximum distance between sets is 1.You may wish to check that the distance between the initial distribution I, which has I(12n)=1 and I(π)=0 for all other orderings, satisifies:

IU=11n!

With this definition, our example indicates that QkU0 as k, which means that shuffling the deck using top-in-at-random shuffles will eventually produce all orderings of the deck with equal probability.

Strong uniform stopping rules

Given a technique for shuffling the deck, and its resulting probability density function Q, we would like to be able to estimate how far away from the uniform distribution we are after k shuffles; that is, we would like to understand the distance QkU.

The notion of a strong uniform stopping rule gives us a tool for understanding this distance. First, imagine that we look at each shuffle in a sequence of shuffles and that we have a criterion that stops the sequence when satisfied.

For example, imagine that we have a sequence of top-in-random shuffles and that we stop the sequence when the card that was originally at the bottom of the deck (and labeled by n) rises to the top and is then inserted somewhere in the deck.

This is illustrated below for the case n=3. The bottom card is shown in red so we stop the sequences at the orderings in the gray box.

We call such a criterion a strong uniform stopping rule if when the sequence is stopped after k shuffles, then the resulting orderings are uniformly distributed. As a little thought shows, the rule described above for top-in-at-random shuffles satisfies this condition since at every step the ordering of the cards below card n is uniform. This is apparent, for the case n=3 and k=3, in the figure above.Why are strong uniform stopping rules useful? The following remarkable fact explains.

Suppose that T denotes the stopping time for a sequence of shuffles and P(T>k) denotes the probability that the stopping time of a sequence is larger than k. Then we have the following bound on the distance beween Qk and U:

QkUP(T>k).

In other words, this reduces the problem of comparing the distance between the density after k shuffles and the uniform density to an analysis of the stopping time. As we’ll see, this can be a much simpler problem.Where does this bound come from? It’s fairly straightforward. Remember that the distance QkU is defined by looking at the difference in the densities on subsets A of Sn. By Xk, we will denote the ordering that results from shuffling k times.

We’ll begin by noting that we may partition the sequences of shuffles in which Xk is in A by their stopping times:

Qk(A)=jkP(XkAandT=j)+P(XkAandT>k)

We will rewrite both of the terms on the right. Consider the first term: here’s where we use the fact that the orderings that result from a fixed stopping time are uniform:

jkP(XkAandT=j)=jkU(A)P(T=j)=U(A)(1P(T>k)).

We will rewrite the second term using the conditional probability:

P(XkAandT>k)=P(XkA|T>k)P(T>k)

Combining these two expressions gives

Qk(A)=U(A)+(P(XkA|T>k)U(A))P(T>k),

which is the same as saying

Qk(A)U(A)=(P(XkA|T>k)U(A))P(T>k).

Now since P(XkA|T>k) and U(A) are both probabilities, their values are between 0 and 1. Therefore, the absolute value of their difference is as well as we obtain:

Qk(A)U(A)P(T>k).

Since this holds for every set A, we obtain the desired bound:

QkUP(T>k).

Riffle shuffles

Armed with this tool, we may study how fast a particular shuffling process converges to the uniform distribution by finding a strong uniform stopping rule and determining the probability that the stopping time is larger than k. We will apply this tool to a study of riffle shuffles, which model the usual way in which a deck of cards is shuffled.

To perform a riffle shuffle, we choose c cards from the top of the deck according to the binomial distribution. That is, the probability that we choosec cards is

12n(nc).

We hold these cards in our left hand and the other nc cards in our right. A card now falls from either our left or right hand with the probability that the card falls from one hand being proportional to the number of cards in that hand.

This description models the physical act of shuffling cards. However, an alternate way to describe this shuffle is like this: choose the c cards off the top according to the binomial distribution. For instance, here we choose c=3 cards.
Now choose, with equal probability, a set of c positions within the deck of n cards.
Place the chosen cards, in order, in these positions, and the remaining nc cards, in order, in the other positions.

We will denote by R the probability density on Sn defined by one riffle shuffle. We wish to study Rk, the density that results after k riffle shuffles, and determine when it is sufficiently close to the uniform density to consider the deck well shuffled.

It turns out that it is easier to answer this question by considering what happens when we undo a riffle shuffle. To do this, simply walk through the deck labeling every card, with equal probability, with a “0” or “1.”
Then use the labels to divide the cards into two ordered groups and place the group labeled “0” on top.

This results in the inverse riffle shuffle:

The probability density R¯¯¯¯ defined by the inverse riffle shuffle is the same distance from the uniform distribution as the original riffle shuffle. To see this, think of π, an ordering of the cards, as defining a permutation of the n cards. If π¯¯¯ is the inverse permutation, then we haveR¯¯¯¯(π)=R(π¯¯¯). Given a set of permutations A, we will let A¯¯¯¯ be the set of inverses of A. We therefore have

R¯¯¯¯k(A)U(A)=Rk(A¯¯¯¯)U(A¯¯¯¯),

which implies that R¯¯¯¯kU=RkU.

A stopping rule for inverse riffle shuffles

Now that we have seen that the densities defined by inverse riffle shuffles lie the same distance from the uniform density as those defined by riffle shuffles, we would like to develop a strong uniform stopping rule for inverse riffle shuffles. But first, let’s describe a means of enumerating inverse riffle shuffles.

Suppose we perform a sequence of k inverse riffle shuffles. In each shuffle, each card is labeled with a “0” or a “1.” If we concatenate the labels from each shuffle, then each card is labeled with a string of k 0’s and 1’s. (We usually call such strings k-bit strings.)

To summarize, a sequence of k inverse riffle shuffles defines an ordering of the n cards as well as a set of n k-bit strings. Conversely, if we choose an ordering of the cards π and a set of n k-bit strings, we may define a sequence of k inverse shuffles: begin with the standard ordering of the cards and perform inverse shuffles, based on the appropriate bit:

The ordering on the deck of cards that results is π.The stopping rule is simple: stop when the cards have distinct labels. To see that this is a strong uniform stopping rule, simply notice that the choices of an ordering π and a set of n k-bit strings are independent. Therefore, if B is a set of distinctk-bit strings and π1 and π2 are two orderings of the deck, then (π1,B) and (π2,B) give two sequences of inverse riffle shuffles that are equally likely and that lead to π1 and π2, respectively. Therefore, we are just as likely to see π2 as π1 as a result of a sequence of inverse riffle shuffles with stopping time k.

Now we’re in great shape. If T is the stopping time of a sequence of inverse riffle shuffles, we may apply our earlier result:

RkU=R¯¯¯¯kUP(T>k).

We’ll compute P(T>k), the probability that the stopping time is greater than k, by working instead with P(Tk)=1P(T>k). Suppose we have a sequence of k inverse riffle shuffles with Tk (if T<k, just shuffle a few more times for a total of k shuffles). As before, this leads to an ordering π and a set of n distinct k-bit strings. The number of orderings π is n! and the number of n ordered distinct k-bit strings is n!(2kn) since there are 2k k-bit strings. This means that the number of sequences of k inverse riffle shuffles with a stopping time less than kis

(n!)2(2kn).

Now the total number of sequences of k inverse riffle shuffles is the number of orderings π times the number of length n k-bit strings, which is n!(2k)n. This gives:

P(Tk)=(n!)2(2kn)n!(2k)n=2k!(2kn)!(2k)n=j=1n1(1j2k).

This leads to the estimate

RkUP(T>k)=1j=1n1(1j2k).

With this in hand, let’s consider shuffling a typical deck of n=52 cards using riffle shuffles. We find the following bounds on the distance of Rk and U, which we will denote by d(k):

k d(k)
1 1.00
2 1.00
3 1.00
4 1.00
5 1.00
6 1.00
7 1.00
8 1.00
9 0.93
10 0.73
11 0.48
12 0.28
13 0.15
14 0.08
15 0.04
16 0.02
17 0.01
18 0.01
19 0.00

With this as our guide, we see that d(k) is relatively constant for small k but decreases exponentially for larger k. There is consequentially a region of transition where d(k) changes from roughly constant to decaying exponentially. It seems reasonable that some value k in the middle of this transition gives an appropriate number of shuffles to guarantee that the deck is sufficiently randomized. Using this model, it appears thatk=12would be a good recommendation for the number of shuffles.

Summary

A more sophisticated study enabled Diaconis and Bayer to improve this bound: for a deck of n=52 cards, they found

k d(k)
1 1.00
2 1.00
3 1.00
4 1.00
5 0.92
6 0.61
7 0.33
8 0.17
9 0.09
10 0.04

Based on this analysis, Diaconis has written that “seven shuffles are necessary and suffice to approximately randomize 52 cards.” Of course, our technique has just given an upper bound for the distance between Rk and U. In fact, J. Reeds, in an unpublished manuscript, introduced a technique to find a lower bound: R6U0.1. This lends further evidence to the fact that seven shuffles should be used. Please see the Postscript to this article for a further discussion. .Of course, we could use a computer to generate random orderings of the deck, but we still need a reliable method to ask the computer for the next ordering. Bridge Clubs originally swapped 60 cards at random, but Diaconis and Shahshahani showed that this is not enough to generate sufficiently random orderings.

Knuth describes a process that proceeds in stages beginning at i=1. Choose a random number j so that ijn and interchange the cards at positionsi and j. This generates the uniform probability density with 51 swaps.

A description of the current process using by Bridge Clubs is given by the website Bridge Hands.

Does it really matter? Yes! Martin Gardner describes some card tricks that rely on the fact that three riffle shuffles is not enough to generate random orderings. For example, suppose that a deck is shuffled three times and cut in between the shuffles. If a card is taken out, recorded, and put back in the deck in a different position, then that card can be determined almost all the time. De Bruijn also describes a similar trick.

The model we have adopted for the riffle shuffle seems reasonable, but how well does it model shuffles performed by a human? It depends on the human. Studies show that professional dealers drop single cards from one hand roughly 80% of the time and pairs about 18% of the time. Less experienced shufflers drop single cards about 60% of the time. Of course, when you’re playing Crazy Eights with a kid, the cards sometimes get thrown all over the room resulting in the uniform distribution after one toss!

Mathematical Card Deal Theory and it’s  Advantage

The clear casino’s advantage derives from the fact that the Dealer draws last. If you and the Dealer go over (bust), casino wins. Have you ever noticed that the Dealer deals cards with a specific way? Instead of dealing two cards (first way) to the first player, two cards to the second player, two cards to the third player etc, he deals one card to each player and himself, and starts again from the beginning (from the first player) dealing the second row of cards to the players (2nd way). Let’s say that the deck contains the following row of cards: A1, A2, A3, A4 … Aμ-1, Αμ.

If the Dealer deals cards using the first way, then they shall receive the following cards:

  • the first player (A1, A2)                     1 (5)
  • the second player (A3, A4)
  • the third player (A5, A6)
  • the ν -player (A2ν-1, A2ν)

The second way though, is the one that the Dealer uses, that means that they shall receive the following cards:

  • the first player (A1, Aν+2)  1 (4)
  • the second player (A2, Av+3)
  • the third player (A3, Aν+4)
  • the ν- player (Aν, A2ν+1)

However according to the “packs phenomenon” (many large or small cards grouped together), if A=10 (a pack of cards with value of 10) then the pairs of the cards (A1, Aν+2), (A2, Av+3) …(Aν, Α2ν+1) create more sum-totals from 12 το 16 than the pairs of the cards (A1, A2), (A3, A4) …(A2ν-1, Α2ν).

Therefore, you must stand on as low as 12, because the “packs phenomenon” and the specific deal of the cards will burn your hand in higher percentages, fact that offers to casino a clear advantage over you. For this reason you must stick to your cards and all the possibilities are in favour of you, because you force the Dealer to hit and go over (BUST)! The way that Dealer will gather players cards in combination with an inadequate shuffle will result the creation of the “packs’ phenomenon” ex.

*1st player’s cards  7, 6, 2, 7
* 2nd player’s cards  5, 4, 4, 2, 8
* 3rd player’s cards  2, 5, 8, 6
* 4th player’s cards  6, 8, 2, 7
* 5th player’s cards  5, A, 10, K.
Pay attention to the flow of the cards inside box (Shoe) after Dealer gathers it:
7,6,3,7,5,4,4,2,8,6,8,2,7,5,Α,10,Κ,2,5,8,6.
From 7 to A there are fourteen babes (small cards) in the flow! This is a pack of small cards (babes pack). Even in the condition that the players have good hands that no need improvement over Dealer’s Face Card, it is created once more the “packs phenomenon” but with strong cards.

Obsessive Ideas

There is a certain detail that even the best blackjack professionals can hardly understand while it is very simple.They use the word “long-term” and they think that it is approached through the giving this way equal statistic period of appearance for every card and finding the percentage of advance or not for every. Moreover they do they consider the Law of the Big Numbers assuming as an unfortunate example an ideal coin! That means that the probability of heads and tails is of equal value!

In real life there is no such thing as a perfect coin!! Even for thousands of a gram one of the two sides will be heavier, so long-term speaking there will be a greater chance of appearance of the heavier side!! Something similar applies for Blackjack. The deck hasn’t got enough time to be properly mixed (the coin has one side heavier). As a comparison one can say that the less mixed a deck of card is the heavier the coins side is. And the same game goes on with a deck that isn’t mixed. When the deck reaches the point where it is mixed then the Casino stops the game (shuts the table) and the table reopens when the decks are set again to their original position.
Therefore one can be playing long-term by using the short-term mixing of the deck. He can never be able to achieve statistically equal period of appearance for every card!! Simply the Law of the Great Numbers will make its appearance making the unequal statistically period of i.e. how many times the Dealer’s “6” binded with a queen and a “5” and made a “21” more notable. But this statistically period appears in greater percentages than it should.

The wrong base of all the Theories that exist in the market is resbonsible for the Economic Disaster of every player from the simplest player to the profes-sional Card Counter. Casino of great reputation in Greece was using 6 decks for the Blackjack while since January of 2006 uses 4 decks of cards!! As a matter of fact at their site this Casino even now mentions that at their game they use 6 decks! Did they forget to correct this? You think that this sudden reduction of the decks (less mixing is required for acquiring the good assortment) that appeared at the same period of time that our site appeared is coincidental?

World BlackJack Originalities by BlackjackASSUS 

1 (3)

How many times have you played Basic Strategy and lost all your capital rapidly?

How many times have you won and how many times have you lost while playing precisely the Basic Strategy?

Basic Strategy plights that if you precily apply it during your game,you will lose in long-term only 1% of your money.But how much is long-term?Most likely when t extends to infinity (t>oo)…

And how many years live an average person?
Eventually we could assume that the Basic Strategy was established to be using by Aliens who live eternal…
It is said that probably the condition long-term of Basic Strategy means a definite time as it is proved by computers.But computers can shuffle the decks infinite times while casinos can’t do that.
A few years ago, Harvard University studied the shuffling of cards
* (primary assortmentand is:

Α,2,3,4,5,6,7,8,9,10,J,Q,K,Α,2,3,4,5,6,7,8,9,10,J,Q,K,Α,2,3,4,5,6,7,8,9,10,J,Q,K,Α,2,3,4,5,6,7,8,9,10,J,Q,K,Α,2,3,4,5,6,7,8,9,10,J,Q,K,Α,2,3,4,5,6,7,8,9,10,J,Q,K )
and concluded that one pack of 52 sorted cards needed 7 shuffles (constant). So, if a casino uses a shuffling machine with 6 packs of cards to achieve a good assortment, the packs must be shuffled 7χ7χ7=117.649 times.

It’s practically unobtainable in good time, because it takes days for this slowing down games at casinos and limits their gain.

So casinos can’t avoid the appearance of the ”pack phainomenon”!

The Basic Strategy necessitates infinite shuffles of the decks (shuffle machines can’t do it practically) to achieve chance setting of the cards,and infinite time to apply the Law Of Large Numbers.Casinos rely in the above condition playing 24 hours a day with a inexhaustible capital! That’s why Casinos win constantly,because Basic Strategy is the certain way for a player to lose all his money rapidly!!
The question is how we could turn to advantage the “packs phainomenon”…How can we manipulate these capricious distributions of the decks?If we only could (in a way) “make” these distributions and thereafter seek for the appropriate strategy that will turn to account the prospects of our cards and dealer’s card. That is exactly what our program do!!It “makes” any distribution of the decks and demonstrates the odds of our success in a definite time:
• You don’t have to remember numbers
• You don’t have to practice constantly, it’s
ֺ easy in it’s use!
• You don’t need to strain effort ֺ just clever way!
• It shows precily the array of the cards that
ֺ appear!
• It simulates any Casino without regard to ֺthe number of decks that it uses
• It’s versatile in any financial ֺ strategy of the player!
• It rejects Basic Strategy!
• It’s based in a stunning random algorithm
ֺ that generates numbers!
• The first Program worldwide that ֺ simulates the Black Box (shuffles ֺthe cards with replacement)ֺand the “Shoe” (withought ֺreplacement)!
• It has accuracy of many digital numbersֺ in it’s results with percentage %!
• It draws up to 1,000,000 times and
ֺ uses 1-30 decks in a few seconds!
• It has simple apearance and use!
• It has small size (2 MB), but fast in it’s results!
The BlackjackASSUS occupies exclusively with the discovery of new theories and concepts in the Theory Of Numbers,which is the capstone of Maths(as it’s called by the scientific community) and by extension Blackjack,which the only technical and not lucky game in the Casinos.

Really, Blackjack conceals so much science in it’s depth that verges art..

My name is Black Jack Assus, but people call me Black Jack Assus.
Here is my homepage: .
My Website France and work as an at .