Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Three people are playing the following betting game.
Every five minutes, a turn takes place in which a random player rests and the other two bet against one another with all of their money. The player with the smaller amount of money always wins, doubling his money by taking it from the loser.
For example, if the initial amounts of money are 1, 4, and 6, then the result of the first turn can be either 2,3,6 (1 wins against 4); 1,8,2 (4 wins against 6); or 2,4,5 (1 wins against 6). If two players with the same amount of money play against one another, the game immediately ends for all three players.
Your task is to find initial amounts of money for the three players, where none of the three has more than 255, and in such a way that the game cannot end in less than one hour.
In the example above (1,4,6), there is no way to end the game in less than 15 minutes.
Update (05/05): all three numbers should be positive integers. For example, [0,1,2], is not a valid answer since the game would end immediately.
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
There are three solutions (up to permutations of the amounts) for the money the three players start with, so that at least 12 rounds (or one hour) of betting will take place with amounts no greater than 255: (175,199,223), (197,205,213), and (209,217,225). Incidentally, there is no solution for 13 rounds of play.
Thanks to John Tromp for creating the relevant sequence: https://oeis.org/search?q=A256001.
Goran Zuzic uploaded a proof (https://gist.github.com/Zuza/36b5ea4d199d14d8f22c) that for any three numbers, the game can end in finite amount of time.