Permutation sounds like something very smart, but as far as I see this is pretty simple, isn't it?
Simply parse the dictionary. If a word consists of characters that are all contained in the array then you can add them to the permutation list.You may also check the list for double entries. Did I miss something?
eg:
word$="ARRANGED"
dict$=read word by word from the directory
noway=0
for i=1 to len(dict$)
mi$=mid$(dict$,i,1)
if instr(word$,mi$)=0
noway=1 ; uses chars we ain't got in our word
endif
next
if noway=0 then add it to the list.
Simply parse the dictionary. If a word consists of characters that are all contained in the array then you can add them to the permutation list.You may also check the list for double entries. Did I miss something?
eg:
word$="ARRANGED"
dict$=read word by word from the directory
noway=0
for i=1 to len(dict$)
mi$=mid$(dict$,i,1)
if instr(word$,mi$)=0
noway=1 ; uses chars we ain't got in our word
endif
next
if noway=0 then add it to the list.