Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
A gardener has 12 barrels of special fluid to water his orchids; exactly two of the barrels are poisonous. Using any amount, even a single drop, from a poisonous barrel will kill the precious orchid in 24 hours. The gardener has only three days before the orchids die unless he can figure out which ten barrels are the good ones. He is willing to sacrifice four orchids by watering them using a mix from a subset of these barrels. How can he find the poisonous barrels?
For example, for eight barrels labeled A, B, C, D, E, F, G, and H, only two days are enough:
| Day1 | Day2 | |
|---|---|---|
| 1 | B | DG |
| 2 | DF | AB |
| 3 | AH | CF |
| 4 | C | GH |
In the first day he waters orchid #1 from barrel B, on the second day he uses a mix from barrels D and G; etc. Supply your answer in the format B.DG; DF.AB; AH.CF; C.GH (corresponding the solution to the example above).
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 is a simple solution for 4 barrels and 1 day: A;B;C;D.
Adding the prefix E,F,G,H provides a trivial solution for the example with 8 barrels and 2 days:
E.A;F.B;G.C;H.D
Alas, it does not work for our 12-barrel 3-day problem since I.E.A;J.F.B;K.G.C;K.H.D does not distinguish, for example, between IA and IE.
However, the example we gave included a (very) large hint. You can add an I,J,K,L prefix to it and get the solution:
I.B.DG;J.DF.AB;K.AH.CF;L.C.GH
Thanks Patrik Holopainen for his blog Genetic Algorithms — Solving IBM’s January 2020 problem