Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
This puzzle was suggested by Victor Chang.
The New York Times' "Letter Boxed" puzzle consists of a square with three letters on each side - a total of 12 unique letters. In the puzzle, you write down a sequence of words while following these rules:
For example, if the box consists of the following letters, three on each side: 'hou wcr tka nbl', a valid solution would be ['burnt', 'throw', 'warlock']. There is also a two-word solution, ['unclot', 'throwback'] if one accepts esoteric words (which is not necessarily the case for the NYT).
We are interested in finding puzzles with unique two-word solutions, even when the allowed dictionary is large. For this puzzle, we used the word list located here
Your goal: Find a box that has only a single two-word solution. Submit the box as a string, e.g., 'hou wcr tka nbl', with the two-word solution as well.
A bonus "*" will be given to those who find a sequence of at least 15 letters that also has a unique solution. This can be achieved by either adding more sides to the polygon (e.g., a pentagon with three letters on each side instead of a square) or by adding more letters to each side (e.g., 4 letters on each side of the square). Submit your solution in the same format as shown 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
December 2022 Solution:
David F.H. Dunkley have sent an elaborate explanation of his solution, given below – thanks David!
12 letters -
avd lbw peo htf
alphabet , twelvefold
15 letters (pentagon with three letters per side)
ugy ner jlb dkw ios
unjudgelike , eyebrows
22 letters (hendecagon with two letters per side)
cb ai nt ew ok rg fm lh ds yp ux
cabinetworking , formaldehydesulphoxylic
My program makes 26-bit masks of the letters from each word, and then compares all mask pairs with bitwise or
operation to find the pairs of masks that combine to a "pair mask" with 12 bits set.
Then it searches through each of the words that belong to each of those pairs of masks, to find how many have
start/end letters in common.
If there is only one, then that's a great candidate to build a letter box. It's fairly trivial to build the Letter Box, given two
words that I know are unique in covering the 12 letters.
If there is more than one word pair for the 12 letters, it would surely be possible to build a Letter Box that only allows
one pair to work. I didn't follow that idea through.
The program outputs a list of all the unique word pair candidates. There are 250,170 candidate unique word pairs, for twelve letters. I tried to pick relatively "ordinary" words for my solutions, as far as possible, because even though I am a native English speaker, most of the words in the list are really strange to me!
It was simple to change the program to work with 15 letters or more. 22 letters was the most it could find a unique pair for.