A dice rolling quesiton (from D&D 4.0)

  • Thread starter Thread starter lawtonfogle
  • Start date Start date
  • Tags Tags
    Dice Rolling
lawtonfogle
Messages
159
Reaction score
0
The basic idea is this. You get to roll 5 or 6 12-sided dice (d12). For any 12's your roll, you every 12 you roll, you get to roll another d12, and if any of those result in 12's, you get another d12. What I have been trying to figure out is what is the average number of dice rolled and the average valued rolled when you start with 5 and when you start with 6 (or in a more general since, when you start with n for n being any natural number).

I have thought about how to do this, but the only thing I can even guess at trying to is make a summation for each number of rerolls, for example in the case of no rerolls we have:

6 * 6 * (11/12)^6. The first six is the average roll on a d12 when you do not count 12's (because of no rerolls). The second six is for there being 6 dice.

In the case of one extra roll, we have (I think):

6 * 6 * (11/12)^6 + 12 * 1 * (1/12). The first half is for the 6 dice not resulting in an extra roll (one of which would be the extra roll dice). The last one is for the one dice which did result in an extra roll. We have to get a 12, for there to be one extra roll, a 1 since there is only one such roll, and (1/12) for our over all chance of getting this.

So what I think the summation would be is as follows.

6 * 6 * (11/12)^6 + Summation(Starting at i = 0, going to infinity, f(i) = (12 * i * (1/12)^i)). The total of this gives the average valued rolled under this method... I think. Can anyone look over this, and if it is correct, what is the best way to calculate the summation portion? I think there may something involving Calculus estimations of summation, but it has been quite a while.
 
Physics news on Phys.org
Does it really matter with how many dice you start? Assume you start with only one and denote by N the number dice you are allowed to roll in this setup, i.e. 1+ number of extra rolls, by EN the average number of rolls, and by EV the average valued rolled.

if you are now given n dice, you just repeat this experiment n times, and everything is independent, so you should be able to verify that now the average number of rolls in n*EN and that the average value rolled is unchanged.

It is thus enough to consider the case n=1. the number of rolls follows what is called a geometric distribution.

Can you then finish it?
 
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