Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
This problem is based on a suggestion by Frank Mayer - thanks Frank!
Alice and Bob play the following weird dice game using a standard set of 6 D&D dice, i.e., dice with values
At each round, they throw the dice and sum their values. All six dice need to be rolled once each round, and it doesn’t matter who rolls the dice. What matters in deciding who wins is the sum.
Alice wins if the result is a prime number, and Bob wins if the result is a nonprime even number. Otherwise, the result of the round is a draw.
The winner of the game is the first player to reach consecutive wins.
Your goal: For , find the probability that Alice wins the game.
A Bonus "*" will be given for finding the probability that Alice wins given that but the rules have changed and Bob now wins if the result is a nonprime odd number.
We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!
We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com
February 2024 Solution:
This problem turned out to be more challanging than expected, due both for the (non intentional) tricky phrasing and the nontrivial mathematical structure involved.
Some of you interpreted " consecutive wins" of Alice to be "a sequence of at least rounds in which are Alice wins and the rest are draws". This was not the intention - a draw certainly interrupts a sequence of wins.
Others correctly calculated Alice's chance to win a round (0.24826171875, can be found by straightforward enumeration of all cases) and raised it to the power of N; this is wrong, since it answers the different question "If Alice and Bob play exactly rounds, what is the chance of Alice winning all of them?" whereas the real question is "given that Alice and Bob play indefintely, what is the chance that at one point of the game Alice will have consecutive wins?"
The natural way to solve such a question is by using Markov chains. In this formulation, we consider all the states the game can reach; here the states are of the form "Alice has consecutive wins" and "Bob has consecutive wins". This can be modeled using a single integer (e.g. means "Bob has 2 consecutive wins"). We have a simple transition matrix, with each row having at most three nonzero entries corresponding to Alice win, Bob win and draw.
We are interested in the hitting probability for the state representing Alice's win; a standard result in the theory of Markov chains is that the hitting probability vector for a set of states is the minimal nonnegative solution to the system of linear equations
Solving this system yields the winning probability for Alice (where is Alice's probability for winning a round and is Bob's)
Plugging
yields
and plugging
yields