Hi all,
I'm putting together a word game (using B3D) but am having a bit of a headache with one particular part.
Basically, an 8-letter word is picked at random from a dictionary, and each of the 8 letters are then placed in an array.
How can I then 'check' (against the dictionary) all words that can be made from these letters? (i'm limiting it to 3-8 letter words, so things like that 'at' and 'so' are not necessary.
One thing I also need to take into account, is that if a word contains more than one of the same letters, I don't want it to count the words twice. For example, if the 8 letter word was 'ARRANGED' I wouldn't want to include the word 'ARE' twice.
Let me know if you need any further info!
:)
Cheers,
Matt...
I'm putting together a word game (using B3D) but am having a bit of a headache with one particular part.
Basically, an 8-letter word is picked at random from a dictionary, and each of the 8 letters are then placed in an array.
How can I then 'check' (against the dictionary) all words that can be made from these letters? (i'm limiting it to 3-8 letter words, so things like that 'at' and 'so' are not necessary.
One thing I also need to take into account, is that if a word contains more than one of the same letters, I don't want it to count the words twice. For example, if the 8 letter word was 'ARRANGED' I wouldn't want to include the word 'ARE' twice.
Let me know if you need any further info!
:)
Cheers,
Matt...