Zero-modified geometric dice problem

  • Thread starter Thread starter welcomehome
  • Start date Start date
  • Tags Tags
    Dice Geometric
welcomehome
Messages
1
Reaction score
0
Hi,

I'm trying to come up with a probability for a game I play with a friend of mine. In the game, units "attack" by rolling six-sided dice; either 2 or 4 sides of the die count as a "hit" when rolled, depending on certain circumstances. The specific situation I am trying to figure out the probability for is:

you get n dice to roll.
assume the probability to hit is "p"
for each die, you can re-roll if you miss on your first roll.
for each die, you keep re-rolling as long as you hit.

what is the probability of k hits?

the thing that is causing me problems is the fact that you can reroll the die if you miss at first. So, instead of each die being a geometric random variable, each die is a zero-modified geometric random variable with Pr(no hits) = (1-p)^2.

If the die were simple geometric R.V.s, their sum would be a negative binomial R.V. which I could easily evaluate. Does a similar property hold for zero-modified geometrics R.V.'s? If so, what is the parametrization? If not, how could I figure out this probability?

One idea I had: let Z = the total # of hits,

Pr(Z=k) = Ʃ Pr(X of n dice roll one or more hits) * Pr(Z = k | X dice have one or more hits, n - X dice miss totally).

I got bogged down in the details of this and wasn't able to come up with something that worked; any ideas?!?
 
Physics news on Phys.org
welcomehome said:
for each die, you keep re-rolling as long as you hit.

Do you get to re-roll with a particular die only if you hit with that particular die? Or do you get to re-roll with a particular die if you hit with some of the other dice in the previous roll?

If you only get to re-roll with a particular die when you hit with that particular die, then you don't need to worry about the fact that there are n dice. You can find the expected number of hits for 1 die and mullitiply that by n.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top