crocadcormarlevul.netlify.com

    Craps Conditional Probability

    3/19/2022/ Comments off

    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

    • Conditional Probability Formula
    • Craps Probabilities
    • Craps Conditional Probability Test
    • Conditional Probability Examples
    Craps probabilities

    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. So to get a 6 when rolling a six-sided die, probability = 1 ÷ 6 = 0.167, or 16.7 percent chance. Independent probabilities are calculated using: Probability of both = Probability of outcome one × Probability of outcome two. So to get two 6s when rolling two dice, probability = 1/6 × 1/6 = 1/36 = 1 ÷ 36 = 0.0278, or 2.78 percent.

    The craps dice odds and probabilities list as follows: 2 and 12 have only one way they can be formed on two dice, thus carrying odds of 35 to 1 (a one in thirty-six chance of being rolled). 3 and 11 have two possible formations, so the odds of these appearing are 17 to 1. The probability of winning on a 4 or 10 in craps is (6/36)×(3/9) = 5.56%. Every time this happens you get an extra unit, so it is worth 5.56%. Normally the house edge on the come bet is 1.41%, so overall the player edge under this rule is 4.15%.

    P⁡[E1beforeE2]=P⁡[E1∣E1∪E2]=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⁡(A∣E1)+P⁡(E2)P⁡(A∣E2)+P⁡(B)P⁡(A∣B)=P⁡(E1)+P⁡(B)P⁡(A∣B){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)=1−P⁡(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⁡(A∣B)=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) }}}

    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:

    ∑i=0∞P⁡[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’]=(1−P⁡[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}]}

    Conditional Probability Formula

    The summation becomes an infinite geometric series:

    ∑i=0∞(1−P⁡[E1]−P⁡[E2])iP⁡[E1]=P⁡[E1]∑i=0∞(1−P⁡[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−(1−P⁡[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.

    Craps Probabilities

    Notes[edit]

    • Pitman, Jim (1993). Probability. Berlin: Springer-Verlag. p. 210. ISBN0-387-97974-3.
    Retrieved from 'https://en.wikipedia.org/w/index.php?title=Craps_principle&oldid=957539307'

    A popular dice game, called 'craps,' is played in the following manner. A player starts by rolling two dice. If the result is a 7 or 11, the player wins. If the result is 2, 3, or 12, the player loses. For any other sum appearing on the dice, the player continues to roll the dice until that outcome reoccurs (in which case the player wins) or until a 7 occurs (in which case the player loses).

    a) What is the probability that a player wins the game on the first roll of the dice?
    b) What is the probability that a player loses the game on the first roll of the dice?
    c) If the player throws a 4 on the first roll, what is the probability that the game ends on the next roll?
    d) If the player throws a 4 on the first roll, what is the probability that he will eventually win the game?

    © BrainMass Inc. brainmass.com October 1, 2020, 4:45 pm ad1c9bdddf
    https://brainmass.com/statistics/probability/calculating-probabilities-dice-game-called-craps-13095

    Craps Conditional Probability Test

    Solution Preview

    Conditional Probability Examples

    Please see the attached Word document to view the table described in this solution.

    The values 1 through 6 on the left and top margins of the table are the possible outcomes of one die. The body of the table contains the sum of the two values in the margins, the total when two dice are rolled.

    There are 36 equally likely outcomes when two dice are rolled. The probability of an event when rolling a pair of dice can be determined by counting the ...

    Solution Summary

    The solution gives an intuitive approach to probability problems involving dice. The technique is illustrated by calculating probabilities for the game of 'craps'.

    Post navigation

    Navigation

    Texas Holdem Blinds Schedule
    Empire City Slot Machines

    Related Posts

    • Bulk Poker Chips For Sale
    • National Harbor Mgm Casino Parking
    • Rooty Hill Poker

    crocadcormarlevul.netlify.com