Hello all,
I was recently in London, and while relaxing in the hotel room one day, I saw a cool game show called "Countdown." One part of the game requires contestants to find the longest word possible when given 9 letters. For example if the letters "d u n s c a e y t" came up, one possible answer with 6 letters would be "sunday" another would be "uneasy" Once all the letters are up, the contestants get 30 seconds to come up with an answer.
Well, I'm too lazy to think about such things when a computer can do it for me. Here's the challenge:
Write a program that will take the given letters and using the (english) spell check dictionary of your choice make and verify the validity of the longest word possible. There will always be 9 letters to start with. There may be multiple words with the same number of letters. The output should include all words with the highest number of letters.
If this gets a good response, I will post the numerical part of the game...so those of you that know the game, you have a head start.
update gbarr and dragonchild have so far come the closest to solving the problem. If you change the letters to "d u n s c a e y z" the highest number of letters returned is 6, and both of their solutions only print out "ascend" again, "uneasy" contains 6 letters as well and should also show up as well as "sunday" (if adjusted for case insensitiveness as I did in the test)
Stuffy
That's my story, and I'm sticking to it, unless I'm wrong in which case I will probably change it ;~)
may be reproduced under the SDL
I was recently in London, and while relaxing in the hotel room one day, I saw a cool game show called "Countdown." One part of the game requires contestants to find the longest word possible when given 9 letters. For example if the letters "d u n s c a e y t" came up, one possible answer with 6 letters would be "sunday" another would be "uneasy" Once all the letters are up, the contestants get 30 seconds to come up with an answer.
Well, I'm too lazy to think about such things when a computer can do it for me. Here's the challenge:
Write a program that will take the given letters and using the (english) spell check dictionary of your choice make and verify the validity of the longest word possible. There will always be 9 letters to start with. There may be multiple words with the same number of letters. The output should include all words with the highest number of letters.
If this gets a good response, I will post the numerical part of the game...so those of you that know the game, you have a head start.
update gbarr and dragonchild have so far come the closest to solving the problem. If you change the letters to "d u n s c a e y z" the highest number of letters returned is 6, and both of their solutions only print out "ascend" again, "uneasy" contains 6 letters as well and should also show up as well as "sunday" (if adjusted for case insensitiveness as I did in the test)
Stuffy
That's my story, and I'm sticking to it, unless I'm wrong in which case I will probably change it ;~)
may be reproduced under the SDL
Back to
Meditations