TileSetter ========== General. -------- TileSetter is 'WordFinder' with a board. The idea behind TileSetter was to provide the Scrabble player an 'interactive way' to check words by selecting 'ranges' on the additional board. This way a player can check for normal words, possibilities (you know to see which letters you may want to keep) and 'attached words' (commonly known as hooks). TileSetter does not 'generate' moves: you the user should still provide the program with the right 'moves'. But all and all it's pretty fast but not quite the best way to solve a problem. To find out more about programming Scrabble like wordfinders, I suggest you take a look at the wordgame-programmers mailinglist at Yahoo!. The URL is http://groups.yahoo.com/group/wordgame-programmers. Since today, TileSetter has been released under the General Public License. I don't care what you do with the program, but if you consider extending it, bear in mind that I'd gladly receive fixes and comments. Nothing is perfect, programming is a learning process, and it's only the fun that matters. And it actually works. Developer notes. ---------------- You need Delphi 5. I've removed several components that dealt with 'saving' the board and 'drawing' the board and replaced them with the generic Delphi 5 components. However, you need the HyperStr library: this library is extensively used in the search actions and I've used it to get as much speed as possible. If you can beat that library, go ahead and replace the function calls in the source. If I have ever time to do some new things with TileSetter, I'll most likely use different ways to get search things done, but then when I started this project, I had no idea what Scrabble was or how to play it. The current implementation is only here for educational purposes and does not pretend to be the ultimate solution . Have fun. End notes. --------- Added are the following files. - The sources. - The bitmaps - The TWL98 dictionary as a text file. Arthur Hoogervorst, ahooger@NOSPAMPLEASE.istar.ca ================================================================================ (c) Arthur Hoogervorst 2000, 2001, 2002. ================================================================================