23- 24These sets are always created so that numbers earlier in the list are always smaller than numbers later in the list (this is important later)Step 2: Change the dictionary wordsTake all the dictionary words provided, and create a second version of the dictionary word with all the letters in sorted order (makes it easier to find matches). Step 1: Create static combinationsThe core of the approach is to build a combination set up-front which just uses numbers as indices so that it will work with any tile-set.The combination set looks like:- 12- 13- 14. I'm pretty sure that with time it would be possible to figure out a far more elegant combination generator that has parameters for how many blanks etc.įor now, it's late and I'm going to get some sleep! The fact that the generated words, and the dictionary words are all re-sorted in letter order makes the search really quick - it's just a joinįor one blank tile -very similar approach - just had a slightly more complex combination generator, which took the original one, and wherever tile 7 was used, it exploded out 26 letter combinations.įor 2 blank tiles - took the output from the 1-blank tile combinator and exploded out everywhere that tile 6 was used. So - cat becomes atcĬombine the tiles in every combination that we've pre-computed, bringing in the score from the inputs Take all the dictionary words provided, and create a second version of the dictionary word with all the letters in sorted order (makes it easier to find matches). These sets are always created so that numbers earlier in the list are always smaller than numbers later in the list (this is important later) The core of the approach is to build a combination set up-front which just uses numbers as indices so that it will work with any tile-set. Try to find the highest scoring word using the blank tiles – but be sure that they are not scored! While it is unlikely that a single player has both blanks at a single time, we must be prepared for when it takes place. These tiles are a wildcard and can be used as any letter, but are worth 0 points. Use the workflow and the files attached to get to your solution.Īdvanced Users and Challenge 75 Racers: The game of Scrabble also provides a max of 2 blank tiles. The challenge this week is to find the best word (from a provided text file) that can be assembled from 7 provided letters. It is important to note that the longest word assembled is not always the best word – for example the word of ‘parget’ is worth less then ‘paver’. For example, a player may draw the following 7 tiles: G (2 points), A (1 point), R (1 point), E (1 point), T (1 point), V (4 point). ![]() ![]() ![]() ![]() The player tries to find the word that is worth the most points. Additionally, a point value is assigned to the letters. In the game of Scrabble, you are given 7 tiles with a letter printed on them. This challenge is based off the word game Scrabble. Welcome to Week 75!! We have a few people vying for a new shiny badge!!
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |