Given <code>n</code> dice each with <code>m</code> faces, write a function <code>combinational_dice_rolls</code> to dump all possible combinations of dice rolls. 

Bonus: Can you do it recursively?

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>n = 2
m = 2
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def combinational_dice_rolls(n, m) -&gt; [
 (1,1), (1,2), (2,1), (2,2)
]
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>n = 3
m = 2
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def combinational_dice_rolls(n, m) -&gt; [
 (1,1,1),(2,1,1),(1,2,1),(1,1,2),
 (2,2,1),(1,2,2),(2,1,2),(2,2,2)
]
</code></pre>

Given n dice each with m faces, write a function to dump all possible combinations of dice rolls.

Combinational Dice Rolls

Comments