I got one of those chain letters where you change one letter at a time - TIME -> LIME -> LINE -> LANE -> PANE etc.
Has anybody found the longest path through the 4s in TWL (there are 4,030) (or Sowpods or the union) without duplicating?
Are there any words without any neighbors? (I would think so.)
I ought to be able to program that.
(
Missed 5s: )