![]() prefix tiles can only be pathed from but cannot be pathed to, either/or tiles will require two runs, etc) Run the pathing based on user's selection, taking note of special tiles (e.g.Seek user input on whether user wants to search for words using special tiles only, or search for words of specific length, or search for all words.Detect the presence of special tiles (prefix, suffix, either/or, digram, corners).Get user to manually input the letters left to right, top row to bottom row, in space delimited manner.Define a bunch of functions to help with pathing (given any starting point in the grid, go left/right/up/down/etc to as yet unused tiles to form letter sequences and test if they might be valid words).say the code finds a path with letters in the sequence 'XYZ', there is no point pathing further since there are no words that start with 'XYZ') Prep a set of 'valid' truncated words from the word list (this is used later to decide to stop 'pathing', e.g.Read in a word list (I tried various dictionaries found online and ultimately settled on using a Scrabble word list).The following ideas and approaches were adopted:. My code is designed to work in single-player, and the motivation for this (in addition to the joy of learning to code) is to find those last few pesky 'common words' that Wordament says that I have yet to find. This is a coding project that I was most happy with - building a solver that could search for possible words in the Microsoft Wordament game.ĭisclaimer: Of course, do not use such code to cheat in multi-player.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |