Throwing 2d10 of different colors is equivalent of trowing 1d100. It's nice they have different colors to avoid discussions, but you can throw them in two different bins or one at a time or something. Remember to sum them as (x-1) * 10 + (y-1) + 1, that is a clear indication of why zero-based indexing is better.
(Does someone sell "decade" dice, which faces say: 10, 20, 300, ..., 90 and 100?)
Cool, they also have dice with up to 5 zeros, to build your own 1d-million. I have sizable dice collection but I have never seen a 1d1000000 in person, I need to get one...
I agree, but I'm just now porting a program from fortran to python. They read and write files that use their own convention about indexing and values [1]
And some changes may have to been backported, and it has a lot of tricks with index of arrays of different dimensions, so I'm wrapping the formulas with +1 and -1 and hopping the best.
IIRC the python compiler does not optimize them (perhaps with numba?), but later steps in other programs are slow, so N <= 20 and whatever I do is bounded by 20^4.
[1] If the file says "1 2 7.0 \r 1 2 8.0 \r" should I keep the sum (15.0), the first (I never seen that) or the last? (Raising an error, nah.)
I would say yes, because the physics of rolling two objects is slightly different than one object. I don't have any idea, though, if that would affect the distribution of numbers rolled. It's not an experiment that can be done through simulation.
Throwing 2d10 of different colors is equivalent of trowing 1d100. It's nice they have different colors to avoid discussions, but you can throw them in two different bins or one at a time or something. Remember to sum them as (x-1) * 10 + (y-1) + 1, that is a clear indication of why zero-based indexing is better.
(Does someone sell "decade" dice, which faces say: 10, 20, 300, ..., 90 and 100?)
> (Does someone sell "decade" dice, which faces say: 10, 20, 300, ..., 90 and 100?)
Yes, they do. I used to use them for this exact purpose.
E.g.
* https://boxcarsandoneeyedjacks.com/product/10-sided-decade-d...
* https://extrememathgames.com/product/10-sided-decade-dice-00...
Cool, they also have dice with up to 5 zeros, to build your own 1d-million. I have sizable dice collection but I have never seen a 1d1000000 in person, I need to get one...
almost all d10's are zero-based, 0-9. And the "decade" die is 00-90. So it's just a simple matter of adding the rolls, no complicated math. And 0=100.
> (x-1) * 10 + (y-1) + 1
Is that not equivalent to:
> (x-1) * 10 + y
or:
> x * 10 + y - 10
I agree, but I'm just now porting a program from fortran to python. They read and write files that use their own convention about indexing and values [1]
And some changes may have to been backported, and it has a lot of tricks with index of arrays of different dimensions, so I'm wrapping the formulas with +1 and -1 and hopping the best.
IIRC the python compiler does not optimize them (perhaps with numba?), but later steps in other programs are slow, so N <= 20 and whatever I do is bounded by 20^4.
[1] If the file says "1 2 7.0 \r 1 2 8.0 \r" should I keep the sum (15.0), the first (I never seen that) or the last? (Raising an error, nah.)
I would say yes, because the physics of rolling two objects is slightly different than one object. I don't have any idea, though, if that would affect the distribution of numbers rolled. It's not an experiment that can be done through simulation.