A sequence of letters is considered "valid" if it occurs as a substring of a common English word. For example, "RGRO" is valid because it occurs in the word "undeRGROund."

Find a sequence of four distinct letters such that all 23 non-identity permutations of the sequence are valid.

using the string TSAE I found (many using http://www.onelook.com/)
I'm sure people will find better, but it will do for now.

EATS
EAST
ETAS
frETSAw
dESATurate
contESTAnt
hAETS - small amounts (scot.)
AESThete
dATES
cATSEye
teASET
hASTE
TEAS
courTESAn
viTAES - resumes
TASEr
posTSEAson
TSAE (No word found)
SEAT
SETA - hair
chrySAETos - golden eagle
SATE
STEAm
teSTAE - hard sead coats

Posted by Jer on 2005-01-12 22:02:07