Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
What is the probability that the last move in a backgammon (link resides outside of ibm.com) game will be a double? To make things easier, we assume that all the 15 checkers of each player are at their 1-point (just ready to bear-off); so each player, in its turn, removes (bear-off) two checkers for every non-double throw and four checkers for every double.
Hint: The solution is *not* the trivial 1/6.
07/01: Note that there are two players.
07/21: The game is played till its end, even if the result is already determined. For example, when a player has only one checker left, he still throws the dices and game is defined to end with a double if the dices come up equal.
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
Since all the checkers are at 1-point, the players have only one legal move per dice throw - if it is a double they can bear-off four checkers; otherwise they bear-off two. We start with the simpler version of a single player by defining f(n) to be the probability of the last throw being a double when we start with n checkers.
Clearly: f(1)=f(2)=1/6; f(3)=f(4)=11/36 and f(n)=1/6*f(n-4)+5/6*f(n-2).
The solution for this recursion formula is f(2n-1)=f(2n)=(2+5*(-1/6)^n)/7.
The recursion formula for two players in the game is a little more complicated:
f(n,m)=1/6*f(m,n-4)+5/6*f(m,n-2) (with similar boundary conditions)
and its solution is f(15,15)=~0.3417.
Note that for the full game, the answer would be even larger, since there are, for example, situations where one may bear off four checkers with a 6-6 throw and none with 3-4 throw.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com