Craps Conditional Probability

However, what makes it cumbersome is a slightly complicated sample space and conditional probabilities! In this lesson, students learn about the game of craps as the avenue for some sophisticated theoretical probability calculations, and they learn why, in the long run, the house always wins. The probability of this happening is 1 out of 10 lakh. There is a probability of getting a desired card when we randomly pick one out of 52. For example, the probability of picking up an ace in a 52 deck of cards is 4/52; since there are 4 aces in the deck. The odds of picking up any other card is therefore 52/52 – 4/52 = 48/52.

rickwolves91
Hey Wizard,
I'm a CJ/CIS major working in a Math department, and I've been asked to convert an open ended question test to multiple choice test. I found your site 'The Wizard of Odds', and was directed here to ask my question. What is the probability of rolling a 2 given your roll only being even, when rolling a 20 sided die? Thank you for your help.
-R
MathExtremist

Hey Wizard,
I'm a CJ/CIS major working in a Math department, and I've been asked to convert an open ended question test to multiple choice test. I found your site 'The Wizard of Odds', and was directed here to ask my question. What is the probability of rolling a 2 given your roll only being even, when rolling a 20 sided die? Thank you for your help.
-R


I know what you probably meant, but you actually need to specify what's on the 20-sided die. If it's 10 through 200 in increments of 10, the probability is zero.
Under the assumption that the d20 contains integers 1..20, here are the answers I'd list on a four-choice pick:
a) 1/2
b) 1/5
c) 1/10
d) 1/20
Edit: What's a 'CJ' major?
'In my own case, when it seemed to me after a long illness that death was close at hand, I found no little solace in playing constantly at dice.' -- Girolamo Cardano, 1563
beachbumbabs
Administrator

I know what you probably meant, but you actually need to specify what's on the 20-sided die. If it's 10 through 200 in increments of 10, the probability is zero.
Under the assumption that the d20 contains integers 1..20, here are the answers I'd list on a four-choice pick:
a) 1/2
b) 1/5
c) 1/10
d) 1/20
Edit: What's a 'CJ' major?


Funny, I read it differently for the same reason. I 'decided' the question stipulated the 20 sides were numbered 2 thru 20, evens only, with 2 identical sides per number, before I read ME's answer. Be interested to see the clarification.
I'm guessing 'Criminal Justice/Crime Scene Investigation' for the major.
If the House lost every hand, they wouldn't deal the game.
TerribleTom
I get confused at 'given your roll only being even'.
I played some Dungeons & Dragons as a kid, so I've seen a d20 or two.
With a d20 (integers 1 through 20) the odds of rolling a 2 would be (drum roll please)... 1 in 20.
If you're saying 'I've got a d20. The next roll will be an even number. What are the odds of that number being a 2?' Then I'd have to say the odds are 1 in 10. But how does one guarantee that no odd number will be rolled?
I'm thinking CJ/CIS is Criminal Justice/Criminal Information Systems.
AxiomOfChoice

If you're saying 'I've got a d20. The next roll will be an even number. What are the odds of that number being a 2?' Then I'd have to say the odds are 1 in 10. But how does one guarantee that no odd number will be rolled?


It's a conditional probability problem. It's guaranteed because the question says it's guaranteed. It's a math question, not a physics question.
rdw4potus
Designing multiple-choice tests is one of my favorite things to do. I see this question, and all I think is 'gosh, i wonder how they're doing answer placement. Is it randomized? Rotated? both?'
ProbabilityMy HS world geography teacher was a sadistic guy. He put patterns into all his tests, but he also rotated the correct answers. So my 100% score could go a,b,c,d,a,b,c,d... while my friend could have the same answers but need to respond d,c,b,a,d,c,b,a... Made colluding and/or selling answers a real pain.
'So as the clock ticked and the day passed, opportunity met preparation, and luck happened.' - Maurice Clarett
rickwolves91
CJ - Criminal Justice
I'm sorry, fellas. The numbers on the dice are 1-20. My understanding of this questions is, what is the probability you will roll an even number and what is the probability that even number will be 2? The next question on the test is 'Find the probability of drawing a king given that you draw a spade.' I'm pretty sure both questions require the same method to solve.
AxiomOfChoice

CJ - Criminal Justice
The numbers on the 20 sided dice are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20. If this reply sounds smartalically, I appologize. I don't really understand what you mean needing to 'specify what's on the 20-sided die.' Anyhow, which is the answer; a, b, c, or d?


There are 10 even numbers. If you know for sure that it is even, then the answer is 1/10.
You can also solve this by going through the formula for conditional probability. To be honest I always have to look it up (check wikipedia for conditional probability), but you will end up dividing 1/20 by 10/20 and get 1/10.
rickwolves91
Thank you.
rickwolves91
CIS - Computer Information Systems (Know thy enemy)
'But how does one guarantee that no odd number will be rolled?' Probable probability.
Thank you.

In probability theory, the craps principle is a theorem about eventprobabilities under repeated iid trials. Let E1{displaystyle E_{1}} and E2{displaystyle E_{2}} denote two mutually exclusive events which might occur on a given trial. Then the probability that E1{displaystyle E_{1}} occurs before E2{displaystyle E_{2}} equals the conditional probability that E1{displaystyle E_{1}} occurs given that E1{displaystyle E_{1}} or E2{displaystyle E_{2}} occur on the next trial, which is

P[E1beforeE2]=P[E1E1E2]=P[E1]P[E1]+P[E2]{displaystyle operatorname {P} [E_{1},{text{before}},E_{2}]=operatorname {P} left[E_{1}mid E_{1}cup E_{2}right]={frac {operatorname {P} [E_{1}]}{operatorname {P} [E_{1}]+operatorname {P} [E_{2}]}}}

The events E1{displaystyle E_{1}} and E2{displaystyle E_{2}} need not be collectively exhaustive (if they are, the result is trivial).[1][2]

Proof[edit]

Let A{displaystyle A} be the event that E1{displaystyle E_{1}} occurs before E2{displaystyle E_{2}}. Let B{displaystyle B} be the event that neither E1{displaystyle E_{1}} nor E2{displaystyle E_{2}} occurs on a given trial. Since B{displaystyle B}, E1{displaystyle E_{1}} and E2{displaystyle E_{2}} are mutually exclusive and collectively exhaustive for the first trial, we have

P(A)=P(E1)P(AE1)+P(E2)P(AE2)+P(B)P(AB)=P(E1)+P(B)P(AB){displaystyle operatorname {P} (A)=operatorname {P} (E_{1})operatorname {P} (Amid E_{1})+operatorname {P} (E_{2})operatorname {P} (Amid E_{2})+operatorname {P} (B)operatorname {P} (Amid B)=operatorname {P} (E_{1})+operatorname {P} (B)operatorname {P} (Amid B)}

and P(B)=1P(E1)P(E2){displaystyle operatorname {P} (B)=1-operatorname {P} (E_{1})-operatorname {P} (E_{2})}. Since the trials are i.i.d., we have P(AB)=P(A){displaystyle operatorname {P} (Amid B)=operatorname {P} (A)}. Using P(A E1)=1,P(A E2)=0{displaystyle operatorname {P} (A E_{1})=1,quad operatorname {P} (A E_{2})=0} and solving the displayed equation for P(A){displaystyle operatorname {P} (A)} gives the formula

P(A)=P(E1)P(E1)+P(E2){displaystyle operatorname {P} (A)={frac {operatorname {P} (E_{1})}{operatorname {P} (E_{1})+operatorname {P} (E_{2})}}}.

Application[edit]

If the trials are repetitions of a game between two players, and the events are

E1:player1wins{displaystyle E_{1}:mathrm {player 1 wins} }
E2:player2wins{displaystyle E_{2}:mathrm {player 2 wins} }

then the craps principle gives the respective conditional probabilities of each player winning a certain repetition, given that someone wins (i.e., given that a draw does not occur). In fact, the result is only affected by the relative marginal probabilities of winning P[E1]{displaystyle operatorname {P} [E_{1}]} and P[E2]{displaystyle operatorname {P} [E_{2}]} ; in particular, the probability of a draw is irrelevant.

Stopping[edit]

If the game is played repeatedly until someone wins, then the conditional probability above is the probability that the player wins the game. This is illustrated below for the original game of craps, using an alternative proof.

Craps example[edit]

If the game being played is craps, then this principle can greatly simplify the computation of the probability of winning in a certain scenario. Specifically, if the first roll is a 4, 5, 6, 8, 9, or 10, then the dice are repeatedly re-rolled until one of two events occurs:

E1: the original roll (called ‘the point’) is rolled (a win) {displaystyle E_{1}:{text{ the original roll (called ‘the point’) is rolled (a win) }}}
E2: a 7 is rolled (a loss) {displaystyle E_{2}:{text{ a 7 is rolled (a loss) }}}

Conditional Probability Formula

Since E1{displaystyle E_{1}} and E2{displaystyle E_{2}} are mutually exclusive, the craps principle applies. For example, if the original roll was a 4, then the probability of winning is

3/363/36+6/36=13{displaystyle {frac {3/36}{3/36+6/36}}={frac {1}{3}}}

This avoids having to sum the infinite series corresponding to all the possible outcomes:

Conditional Probability Worksheet

i=0P[first i rolls are ties,(i+1)throll is ‘the point’]{displaystyle sum _{i=0}^{infty }operatorname {P} [{text{first i rolls are ties,}}(i+1)^{text{th}}{text{roll is ‘the point’}}]}

Mathematically, we can express the probability of rolling i{displaystyle i} ties followed by rolling the point:

P[first i rolls are ties, (i+1)throll is ‘the point’]=(1P[E1]P[E2])iP[E1]{displaystyle operatorname {P} [{text{first i rolls are ties, }}(i+1)^{text{th}}{text{roll is ‘the point’}}]=(1-operatorname {P} [E_{1}]-operatorname {P} [E_{2}])^{i}operatorname {P} [E_{1}]}

The summation becomes an infinite geometric series:

i=0(1P[E1]P[E2])iP[E1]=P[E1]i=0(1P[E1]P[E2])i{displaystyle sum _{i=0}^{infty }(1-operatorname {P} [E_{1}]-operatorname {P} [E_{2}])^{i}operatorname {P} [E_{1}]=operatorname {P} [E_{1}]sum _{i=0}^{infty }(1-operatorname {P} [E_{1}]-operatorname {P} [E_{2}])^{i}}
=P[E1]1(1P[E1]P[E2])=P[E1]P[E1]+P[E2]{displaystyle ={frac {operatorname {P} [E_{1}]}{1-(1-operatorname {P} [E_{1}]-operatorname {P} [E_{2}])}}={frac {operatorname {P} [E_{1}]}{operatorname {P} [E_{1}]+operatorname {P} [E_{2}]}}}

which agrees with the earlier result.

References[edit]

  1. ^Susan Holmes (1998-12-07). 'The Craps principle 10/16'. statweb.stanford.edu. Retrieved 2016-03-17.
  2. ^Jennifer Ouellette (31 August 2010). The Calculus Diaries: How Math Can Help You Lose Weight, Win in Vegas, and Survive a Zombie Apocalypse. Penguin Publishing Group. pp. 50–. ISBN978-1-101-45903-4.

Notes[edit]

Craps Conditional Probability Definition

  • Pitman, Jim (1993). Probability. Berlin: Springer-Verlag. p. 210. ISBN0-387-97974-3.

Craps Conditional Probability Rule

Retrieved from 'https://en.wikipedia.org/w/index.php?title=Craps_principle&oldid=957539307'