What kind of search algorithm you've used?
On 6/26/08, dingo <[EMAIL PROTECTED]> wrote:
>
>
> There are plenty of games on net, where You have fixed (randomly
> generated) letters (let's say fifteen of them) and You have to make up
> as many valid words You can.
>
> There are some constraints, like word must bet nominative noun, but it
> doesn't really matters, You count on external word-list. Let's say
> that You want to write generic program that will generate as many
> (all) words as possible in the SHORTEST time possible (this is the
> point of my post).
>
> So, You have a word-list dictionary (separate file that can change any
> time), then set of letters (suppose a-z, žščřšďťňáéíóúůě, but it
> doesn't really matter too) and You have to generate AFAP all the words
> that exists in word-list that You can get by permutating given
> letters.
>
> Short story:
> You have letters e.g. "O R E U I C R K L N M O E X S" and You have to
> return all words (lenght 2 to 15) that are in dictionary that You can
> assemble from given letters (in the shortest time possible).
>
>
>
> My solution was N-ary tree ( where max N = sizeof(alphabet), in my
> language it's 26+15 ), max depth of tree is 15 (lenght of longest
> valid word) generated from word-list. Each node has list of possible
> succesive letters. Then You just traverse tree to depth according to
> filter (possible succesive letters).
>
> Do You see any !FASTER! solution (algo+DS)? You can waste as many mem
> You want, time is crucial here.
> Thank you...
> -- dingo
>
> >
>
--
-- Mohammad Moghimi
double m[] = { 9580842103863.650391, 133470973390.236450, 270};
int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);}
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
