In this section, we will analyze several simple games played with dice—poker dice in , chuck-a-luck, and high-low. The casino game craps is more complicated and is studied in another section.
The game of poker dice is a bit like standard poker, but played with dice instead of cards.
In poker dice, 5 fair dice are rolled.
In statistical terms, a poker dice hand is a random sample of size 5 drawn with replacement and with regard to order from the population \(D = \{1, 2, 3, 4, 5, 6\}\). For more on this topic, see the chapter on Finite Sampling Models. In particular, in this chapter you will learn that the result of Exercise 1 would not be true if we recorded the outcome of the poker dice experiment as an unordered set instead of an ordered sequence.
The value \(V\) of the poker dice hand is a random variable with support set \(\{0, 1, 2, 3, 4, 5, 6\}\). The values are defined as follows:
Run the poker dice experiment 10 times in single-step mode. For each outcome, note that the value of the random variable corresponds to the type of hand, as given above.
Computing the probability density function of \(V\) is a good exercise in combinatorial probability. In the following exercises, we will need the two fundamental rules of combinatorics to count the number of dice sequences of a given type: the multiplication rule and the addition rule. We will also need some basic combinatorial structures, particularly combinations and permutations (with types of objects that are identical).
The number of different poker dice hands is \(\#(S) = 6^5 = 7776\).
\(\P(V = 1) = 3600 / 7776 \approx 0.46296\).
The following steps form an algorithm for generating poker dice hands with one pair. The number of ways of performing each step is also given:
\(\P(V = 2) = 1800 / 7776 \approx 0.23148\).
The following steps form an algorithm for generating poker dice hands with two pair. The number of ways of performing each step is also given:
\(\P(V = 3) = =1200 / 7776 \approx 0.15432\).
The following steps form an algorithm for generating poker dice hands with three of a kind. The number of ways of performing each step is also given:
\(\P(V = 4) = 300 / 7776 \approx 0.03858\).
The following steps form an algorithm for generating poker dice hands with a full house. The number of ways of performing each step is also given:
\(\P(V = 5) = 240 / 7776 \approx 0.030864\).
The following steps form an algorithm for generating poker dice hands with a straight. The number of ways of performing each step is also given:
\(\P(V = 6) = 150 / 7776 = 0.01929\).
The following steps form an algorithm for generating poker dice hands with four of a kind. The number of ways of performing each step is also given:
\(\P(V = 7) = 6 / 7776 \approx 0.00077\).
There are 6 choices for the score that will appear 5 times.
\(\P(V = 0) = 480 / 7776 = 0.06173\).
The event \(\{V = 0\}\) is the complement of the event \(V \in \{1, 2, 3, 4, 5, 6, 7\}\).
Run the poker dice experiment 1000 times and compare the relative frequency function to the density function.
Find the probability of rolling a hand that has 3 of a kind or better.
\(1896 / 7776 \approx 0.24383
In the poker dice experiment, set the stop criterion to the value of \(V\) given below. Note the number of hands required.
Chuck-a-luck is a popular carnival game, played with three dice. According to Richard Epstein, the original name was Sweat Cloth, and in British pubs, the game is known as Crown and Anchor (because the six sides of the dice are inscribed clubs, diamonds, hearts, spades, crown and anchor). The dice are over-sized and are kept in an hourglass-shaped cage known as the bird cage. The dice are rolled by spinning the bird cage.
In the game of chuck-a-luck, the gambler selects an integer from 1 to 6, and then the three dice are rolled. If exactly \(k\) dice show the gambler's number then the payoff is \(k : 1\) for \(k \in \{1, 2, 3\}\); the bet loses if \(k = 0\). As with poker dice, our basic mathematical assumption is that the dice are fair, and therefore the outcome vector \(\bs{X} = (X_1, X_2, X_3)\) is uniformly distributed on the sample space \(S = \{1, 2, 3, 4, 5, 6\}^3\).
Let \(Y\) denote the number of dice that show the gambler's number. Then \(Y\) has the binomial distribution with parameters \(n = 3\) and \(p = \frac{1}{6}\): \[\P(Y = k) = \binom{3}{k} \left(\frac{1}{6}\right)^k \left(\frac{5}{6}\right)^{3 - k}, \quad k \in \{0, 1, 2, 3\}\]
Let \(W\) denote the net winnings for a unit bet. Then
The probability density function of \(W\) is given by
Run the chuck-a-luck experiment 1000 times and compare the empirical density function of \(W\) to the true probability density function.
The expected value and variance of \(W\) are
So as carnival games go, chuck-a-luck is not too bad.
Run the chuck-a-luck experiment 1000 times and compare the empirical mean and standard deviation of \(W\) to the true mean and standard deviation. Suppose you had bet $1 on each of the 1000 games. What would your net winnings be?
In the game of high-low, a pair of fair dice are rolled. The outcome is
A player can bet on any of the three outcomes. The payoff for a bet of high or for a bet of low is \(1:1\). The payoff for a bet of seven is \(4:1\).
Find the probability of each of the three events in high-low.
Let \(Y\) denote the sum of the two dice scores, and let \(H\), \(L\), and \(S\) denote the high, low, and seven events, respectively. Then
Let \(W\) denote the net winnings for a unit bet. Find the probability density function, expected value, and variance of \(W\) for each of the three bets:
Let \(W\) denote the net winnings on a unit bet in high-low.
So all of the bets have the same expected loss, but the seven bet has greater variance.
Run the high-low experiment 1000 times with each type of bet. Compare the empirical density, mean and standard deviation of \(W\) to the true density, mean and standard deviation.