![]() ![]() It gets more complicated when crossing more letters, but as long as the "possibility tester" does a good job of breaking things down, matching the patterns is easier. ![]() When multiples are found, it just picks the highest scoring word to use. If you don't find anything horizontally, then it can test vertically. Now that it's all broken down, testing the possibilities "should" be easier. There are a few possible patterns to match:Ĭ.) 3-6 letter words with 'h' for second letter. The computer hits the 'h' and then looks left and right. Don't ask me for any code as I'm just learning C myself. I guess that would be a starting point though. Somehow you have to factor in the tiles that have already been laid too. ![]() So you arrange the tiles on your rack into alphabetical order and then search the modified dictionary for the longest word that fits. Or you could download an ordinary dictionary and sort it with another C program. You might find such a dictionary on the web. I've got a feeling that the shorter words are listed first, too. In the crossword dictionary it would be listed thus: To keep it simple it only consists of the words: You can go out and buy such things as crossword dictionaries, (can be used for anagrams too) these have entries arranged in orders of their individual letters. I did read something years ago, and I'm making it up as I go along. And I do know (part of) a crossword algorithm which may help.Īctually, I'm blagging it. I don't know about scrabble algorithms as such, but I guess it's similar to doing a crossword. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |