I tackle the following game analysis:(adsbygoogle = window.adsbygoogle || []).push({});

2 players, two 6-sided dice. Bigger sum of points win.

First roller has an advantage, as he wins even if 2nd player's dice sum equals to his.

As the game is played with doubling cube (potentially increasing the odds before any roll), I tried to enumerate the list of possible sequences.

For instance, if P1 rolls 12, the game ends (1 roll)

However, the. sequences like

2,3,6,12

4,5,8,9,12 etc are plausible.

I tried brutal force calculation and came up with 938 distinct sequences all of them ending with 12, obviously.

I am just trying to double check my calculation and learn at the same time, how to calculate the number of sequences without brutal force?

Any ideas?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Enumeration of increasing sequences of 2 dice sums

Loading...

Similar Threads - Enumeration increasing sequences | Date |
---|---|

Increasing sequence of sigma algebras | Oct 30, 2015 |

Question abot Recursive\Recursively Enumerable Languages | Apr 1, 2009 |

Consistent enumeration on a poset | Dec 14, 2008 |

Recursively enumerable? | Jun 29, 2008 |

Recursively enumerable predicate | Dec 20, 2007 |

**Physics Forums - The Fusion of Science and Community**