]>
In this section, we will analyze several simple games played with dice--poker dice, chuck-a-luck, and high-low. The casino game craps is more complicated and is studied in the next 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. We will record the outcome of our random experiment as the (ordered) sequence of scores:
Thus, the sample space is . Since the dice are fair, our basic modeling assumption is that is a sequence of independent random variables and each is uniformly distributed on .
Show that is uniformly distributed on :
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 . 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 of the poker dice hand is a random variable with support set . 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 is a good exercise in combinatorial probability. In the following exercises, you will need to use the two fundamental rules of combinatorics to count the number of dice sequences of a given type: the multiplication rule and the addition rule. You will also need to remember some basic combinatorial structures, particularly combinations and permutations (with types of objects that are identical). We give some hints on constructing an algorithm for generating sequences of the given type.
Show that the number of different poker dice hands is .
Show that .
Show that
Show that
Show that
Show that
Show that .
Show that .
Run the poker dice experiment 1000 times with an update frequency of 10. Note the apparent convergence of the relative frequency function to the density function.
In the poker dice experiment, set the update frequency to 100 and set the stop criterion to the value of 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 oversized and are kept in an hourglass-shaped cage known as the bird cage. The dice are rolled by spinning the bird cage.
Chuck-a-luck is very simple. The gambler selects an integer from 1 to 6, and then the three dice are rolled. If exactly dice show the gambler's number, the payoff is . As with poker dice, our basic mathematical assumption is that the dice are fair, and therefore the outcome vector is uniformly distributed on the sample space .
Let denote the number of dice that show the gambler's number. Show that has the binomial distribution with parameters and :
Let denote the net winnings for a unit bet. Show that
Show that
Run the chuck-a-luck experiment 1000 times, updating every 10 runs. Note the apparent convergence of the empirical density of to the true density.
Show that
Run the chuck-a-luck experiment 1000 times, updating every 10 runs. Note the apparent convergence of the empirical moments of to the true moments. 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 . The payoff for a bet of seven is .