Hacker News new | ask | show | jobs
by egberts1 34 days ago
I have a tree.

I always started with 3 words

POINT LASED CRUMB

This eliminates not only the most frequent letters but least frequent letters (Bloom filter), leaving rest of infrequent letter set to guess by narrow deduction.

Never failed me.