It evaluates this not only based on how many points a particular move gives, but also by using heuristics to avoid technically higher-scoring moves which are probably detrimental in the long-run. WordSmith plays by searching the board for all possible tile placements and then chooses the best one. It was a fun project, not only because I enjoy Scrabble, but because the problem was interesting enough to require clever algorithmic tricks, but not so tricky I couldn’t do it part-time over three weeks while on vacation in Paris. Not only because then I could play a game I enjoy without needing a ready opponent, but also because a strong computer opponent would teach me more about the game. Even a perfect Scrabble player may still lose due to unfortunate letters or an unlikely countermove.īecause of this, I wanted to see if I could make a computer that plays Scrabble. Unlike chess, AI-researchers’ favorite game, luck and outside knowledge play a role. The game requires a mixture of vocabulary, strategy, pattern-recognition and luck. If CS or Scrabble don’t interest you at all, feel free to skip this article, as I’ll be back next week with my normal writing. While it’s not tremendously complex, it does show a little of the computer science knowledge I picked up through the MIT Challenge. Visit the download page to try it out.įor the rest of this article, I’m going to explain how the program works. I’ve made the project free and open-source, so anyone can play it and also see how it works. The result was WordSmith, a program that lets you play the game Scrabble against a computer. When I finished, I wanted to work on a small and fun project that would test some of the things I learned. While the challenge was exciting and educational, the tight deadline didn’t give me any time for extracurricular projects.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |