Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
There are 24 letters in the Greek alphabet, from alpha, beta, and gamma, through chi, psi, and omega. The names of the letters are of different lengths, from short two-letter names like mu or pi through the seven letters in omicron.
We want to generate a random Greek letter, where the probability of a letter is determined by the length of its name, and the following:
Psi is a special case with a probability of zero (we are actually generating one of 23 letters)
Letters whose names are composed of an even number of letters have a probability of 2^length times the probability of the letter Tau
All the other letters (except Psi and Tau) have a probability of 2^(length-2) times the probability of Tau
So, for example, the letter mu (with a length of two letters) should appear 2^2 = 4 times more than tau. Omicron (with a length of seven letters) should appear 2^(7-2), or 32 times more often than tau.
The task is to generate the random Greek letter using six coin tosses, in which the coins are chosen from two types: one with a probability of p_1 of getting a tails and 1-p_1 of getting heads; and the other with a probability of p_2 for tails and 1-p_2 for heads.
You should give p_1, p_2, and the tosses in the following format:
For example, the following solution (the parenthesis were added just for clarity):
p_1 = 1/2
p_2 = 1/4
1 (2 alpha (1 beta gamma)) beta
We toss the first coin p_1
If it's tails, we toss the second coin
If it's tails
We generate alpha
Otherwise
We toss p_1 and
If it's tails
We chose beta
Otherwise
We chose gamma
Otherwise
We chose beta
Using the schema above yields:
Alpha: 1/8
Beta: 11/16 (= 3/16 + 1/2)
Gamma: 3/16
Credit for the source of this problem will be provided in the solution.
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
A simple way to solve this month's challenge is by p1=1/17 and p2=1/2. However, this solution requires seven coin tosses, and we asked for six.
The solution we meant, and which many of you found, is p1=8/17 and p2=1/3.
Tossing p1 twice, we split the probability to 64/289, 72/289, 72/289, 81/289 and using up to four more coin tosses we get the desired distribution.
See Oleg Vlasii's picture (PNG, 11KB) of the binary tree to solve it.
1
(1 lambda
(2 (2 alpha beta) (2 zeta epsilon)))
(1 (2 (2 gamma omicron) (2 omicron upsilon))
(2 (2 (2 (2 tau eta) (2 rho mu))
(2 (2 phi nu) (2 xi delta)))
(2 (2 (2 chi theta) (2 theta kappa))
(2 (2 pi sigma) (2 omega iota)))))
1 (1 lambda
(2 (2 alpha beta) (2 zeta epsilon)))
(1 (2 (2 gamma omicron) (2 omicron upsilon))
(2 (2 (2 (2 tau eta) (2 rho mu))
(2 (2 phi nu) (2 xi delta)))
(2 (2 (chi theta) (theta kappa))
(2 (2 pi sigma) (2 omega iota)))))
Another solution uses p1=46/289 p2=1/3.
Philip Kinlen sent us another visualization http://abitofmaths.blogspot.hk/2014_12_01_archive.html
This month's problem was inspired by UYHIP's October's challenge: http://www.brand.site.co.il/riddles/201410q.html