Unusual dice

I heard of this problem from Justin James in his TechRepublic post My First IronRuby Application. He tried this fun problem as a toy example to brush up his skills in ruby:

Roll simultaneously a hundred 100-sided dice, and add the resulting values. The set of possible outcomes is, of course, $\{100, 101, \dotsc, 10000\}.$ Note that there is only one way to obtain the outcome 100—all dice showing a 1. There is also only one way to obtain the outcome 10000—all dice showing 100. For the outcome 101, there are exactly 100 different ways to obtain it: all dice except one show a 1, and one die shows a 2. The follow-up question is:

Write a (fast) script that computes the different ways in which we can obtain each of the possible outcomes.

The obvious first strategy is to come up with a function of three variables $(v=\text{value}, n=\text{number of dice}, s=\text{sides per die})$ that expresses the number of different ways to obtain the value $v$ rolling $n$ $s-$sided dice. We may re-write this function iteratively in the following fashion:

 $f(v,n,s)$ $= \displaystyle{\sum_{k=1}^s} f(v-k, n-1, s) = \displaystyle{\sum_{k_1=1}^s \sum_{k_2=1}^s} f\big( v-k_1-k_2, n-2,s)$ $= \displaystyle{\sum_{k_1=1}^s \sum_{k_2=1}^s \dotsb \sum_{k_{d-1}}^s} f(v-k_1-\dotsb-k_{d-1}, 1, s\big)$

with the convention that $f(v,1,s)=0$ provided $v>s$ or $v<1,$ and of course $f(v,1,s)=1$ for $v \in \{1,\dotsc,s\}.$

A simple code (in ruby) that takes advantage of this strategy could be written as follows:

#!/usr/bin/ruby

idice=ARGV[0].to_i
isides=ARGV[1].to_i

def vwnd(value,dice,sides)
if value &amp;lt; 1
return 0
elsif dice==1 &amp;amp;&amp;amp; value &amp;gt; sides
return 0
else
collect=0
for step in 1...sides+1
collect=collect+vwnd(value-step,dice-1,sides)
end
return collect
end
end

for value in idice...idice+(idice*isides-idice)/2+1
stuff = vwnd(value,idice,isides)
print value, &quot; and &quot;, idice*isides-value+idice, &quot; with &quot;, isides, &quot;-sided &quot;,
idice, &quot; dice: &quot;, stuff, &quot;\n&quot;
end


But this is not the best way to attack this problem: this script chokes even with relative small choices of number of dice and sides per die. A different approach to the functional relationship above offers a better chance. The focus is on the second expression:

 $f(v,n,s) =$ $\displaystyle{\sum_{k_1=1}^s \sum_{k_2=1}^s} f\big( v-k_1-k_2, n-2,s)$ $=$ $f(v-2,n-2,s) + f(v-3,n-2,s) + \dotsb + f(v-1-s,n-2,s)$ $+$ $f(v-3,n-2,s) + f(v-4,n-2,s) + \dotsb + f(v-2-s,n-2,s)$ $\vdots$ $+$ $f(v-s-1,n-2,s) + f(v-s-2,n-2,s) + \dotsb + f(v-2s,n-2,s)$

The term $f(v-2,n-2,s)$ appears exactly once; the term $f(v-3,n-2,s)$ appears exactly twice; the term $f(v-4,n-2,s)$ appears exactly three times. You start seeing now how this can work in our advantage, right? Let me make it more clear with a small example:

• 1 dice with 6 faces each: There are six possible outcomes, and each of them can be obtained in a single way.

$\begin{array}{r}\text{outcomes:}\\ \text{ways to obtain it:}\end{array} \begin{array} {|c|c|c|c|c|c|}\hline 1&2&3&4&5&6\\ \hline 1&1&1&1&1&1\\ \hline\end{array}$

• 2 dice with 6 faces each: There are eleven possible outcomes, and each of them can be obtained in different ways:

$\begin{array}{r}\text{outcomes:}\\ \text{ways to obtain it:}\end{array} \begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline 2&3&4&5&6&7&8&9&10&11&12\\ \hline1&2&3&4&5&6&5&4&3&2&1\\ \hline\end{array}$

A strategy to obtain this result from the previous is by collecting the previous array of “ways to obtain the outcomes”—in this case, the vector $\big(1,1,1,1,1,1\big)$—and creating the following matrix of size $(6+5) \times 6$ from it:

$\left(\begin{array}{ccccccccccc} 1&1&1&1&1&1&0&0&0&0&0\\ 0&1&1&1&1&1&1&0&0&0&0\\ 0&0&1&1&1&1&1&1&0&0&0\\ 0&0&0&1&1&1&1&1&1&0&0\\ 0&0&0&0&1&1&1&1&1&1&0\\ 0&0&0&0&0&1&1&1&1&1&1\end{array}\right)$

Add all the elements on each column, to obtain the desired result. Do you see now how to iterate this process?

• 3 dice with 6 faces each: We start with the previous result—the array $\big( 1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1\big)$—and add the elements of the columns of the matrix of size $(11+5) \times 6$ below:

$\left( \begin{array}{cccccccccccccccc} 1&2&3&4&5&6&5&4&3&2&1&0&0&0&0&0\\ 0&1&2&3&4&5&6&5&4&3&2&1&0&0&0&0\\ 0&0&1&2&3&4&5&6&5&4&3&2&1&0&0&0\\ 0&0&0&1&2&3&4&5&6&5&4&3&2&1&0&0\\ 0&0&0&0&1&2&3&4&5&6&5&4&3&2&1&0\\ 0&0&0&0&0&1&2&3&4&5&6&5&4&3&2&1\\ \end{array}\right)$

The result is, in this case, $\big( 1, 3, 6, 10, 15, 21, 25, 27, 27, 25, 21, 15, 10, 6, 3, 1\big).$

The method that I propose is then as follows:

To obtain a vector that indicates the possible ways to compute the sums of all outcomes of rolling $n$ $s-$sided dice by iteration of the above procedure. Start with $m=1$ die, until reaching $m=n$ dice. The initial vector has all ones and length $s$, and each successive $k-$th step of this algorithm will provide us with a new vector of length $s+(k-1)(s-1).$ For the last step $(k=n)$ we have, of course, $s+(n-1)(s-1) = ns-n+1$ possible outcomes.

A ruby script that uses this idea could look like this:

#!/usr/bin/ruby

dice = ARGV[0].to_i
sides= ARGV[1].to_i
original_permutation=Array.new(sides) {1}

def helper(pattern,target,step,size)
if step==1
return target
else
target+=[0]
pattern.each_index{ |x| target[x+1-step+size] += pattern[x] }
return helper(pattern,target,step-1,size)
end
end

def count_permutations(dice,sides,ary)
if dice==1
return ary
else
return puts count_permutations(dice-1,sides,helper(ary,ary,sides,sides))
end
end

puts count_permutations(dice,sides,original_permutation)


Miscellaneous

Generalizations

It is a great exercise to code this fun script in a language more apt to scientific computing: python, sage, matlab, C/C++, Ocaml, and of course look for tricks to simplify and speed it up. A compiled version of this algorithm should not take much time to obtain the desired result. You can even go a little bit farther and code a new script that will compute the number of different ways to come up with the possible outcomes of rolling $n$ $s-$sided dice, where the faces of each die belong in a given set $\{F_1, F_2, \dotsc, F_s\}.$ The values $F_k$ are allowed to be equal, or non-consecutive… anything, really.

Helper: more than a mere helper

The small recursive function that computes the key step of the algorithm is also the key to other similar counting problems. I called it helper for lack of a better word, and you can use it to aid you in other related tasks. For instance, to compute all the binomial coefficients $\binom{k}{n}$ for any $n \in \mathbb{N}$ and $0 \leq k \leq n,$ you could issue:

first_bc = Array.new(1) {1}
def binomial_coeffs(n,ary)
if n==0
return ary
else
return binomial_coeffs(n-1,helper(ary,ary,2,2))
end
end

n=ARGV[0].to_i
puts binomial_coeffs(n,first_bc)


Solution to our problem

The script presented above computes the required different ways to come up with the $10000-100+1=9901$ possible outcomes of rolling a hundred 100-sided dice… in about a minute! (mileage may vary depending on your computer, of course)

time ./justin 100 100

1 100 5050 171700 4421275 91962520 1609344100 24370067800 325949656825 39113958
81900 42634215112710 426342151127100 3943664897925675 33976189889821200 2742363
89824985400 2084196562669889040 14980162794189827475 102217581419177646300 6644
14279224654700950 4126362365711013405900 24551856075980529765105 14029632043417
4455800600 771629762387959506903300

102217581419177646300 14980162794189827475 2084196562669889040 2742363898249854
00 33976189889821200 3943664897925675 426342151127100 42634215112710 3911395881
900 325949656825 24370067800 1609344100 91962520 4421275 171700 5050 100 1

real 1m16.462s
user 1m10.895s
sys 0m1.863s