Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
To mark the announcement by IBM CEO Ginni Rometty about a new era of cognitive computing (http://www.ibm.com/cognitive/outthink/), this month's Ponder This challenges you to create a uniquely solvable verbal arithmetic equation (https://en.wikipedia.org/wiki/Verbal_arithmetic) using English words, whose result is WATSON, and which is composed of only these six letters.
Here are some (wrong) examples:
Remember that different letter must have different numerical value.
SON*SON=WATSON was suggested by many; another common variation was ON*ON*ON*ON=WATSON; but Matthew Rips suggested SON^O=WATSON and Eitan Levine suggested N^O^W=WATSON
Here are a few more solutions:
A*TOAST-TO=WATSON (Chris Shannon)
TOWNS+WANTS+TOWNS+WANTS+TOWNS+WANTS=WATSON (Peter St. John)
SO*WANT=WATSON (Alan Murray, Johnny Waltos)
(TO+A)*TOWN=WATSON (Derrick Liu)
SON*NOT*A+SWAN=WATSON (Luka Zaplotnik)
STATS+A*TON*WOW=WATSON (Matthias Bussas)
ANTS*ON=WATSON (Gregory Giecold)
SANTA + SAW + SON + WANTS + SONATA + AS = WATSON (Kang Jin Cho - thanks for the lovely pictures)
Some gave a solution too long to repeat, like On+ON+...(98761 times)...+ON=WATSON (Kevin Petrychyn)
Don Dodson also sent us an exercise where WATSON=123456: TWAS*NOW-SOWN SAT=WATSON
Andrew Breadmore suggested an acrostic solution: WON+AT*TWO*SO+OWN+NOW = WATSON
Kipp Johnson suggested a nice exercise: NANOWATT mod SONATA = WATSON