Problem 3084. Scrabble Scores - 11

Created by goc3

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This problem builds on the previous problem, wherein you were provided a letter of an existing word on the board and from which you played a word to find the highest scoring word. See the previous problem for more details.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Now, you will be provided a multiplier character array that represents the fifteen possible squares that can be played on, ranging from seven above the existing letter (in which case the existing letter is the last letter in an eight-letter word) to seven below the existing letter (in which case the existing letter is the first letter in an eight-letter word) with the existing letter fixed in the 8th position. The multipliers are the same as in previous problems:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ * D: double word\n * T: triple word\n * Q: quadruple word\n * d: double letter\n * t: triple letter\n * q: quadruple letter]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The center multiplier square will be left blank, since it's already covered by a tile. Write a routine to determine the highest scoring word(s) based on the multiplier squares.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Once again, you will be provided a cell array of strings containing all possible words based on the existing letter and the letters on your tray. In addition to providing the highest score, also provide the word(s) that achieve that score in a cell array. See the test suite for examples. Due to high-scoring tiles, the highest score may not be achieved by the longest word(s).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Related problems:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Previous problem: 10 -</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/3082-scrabble-scores-10\"><w:r><w:t>Word score optimization (known letter)</w:t></w:r></w:hyperlink><w:r><w:t>. Next problem: 12 -</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/3097-scrabble-scores-12\"><w:r><w:t>Word score optimization (first word)</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This problem builds on the previous problem, wherein you were provided a letter of an existing word on the board and from which you played a word to find the highest scoring word. See the previous problem for more details.Now, you will be provided a multiplier character array that represents the fifteen possible squares that can be played on, ranging from seven above the existing letter (in which case the existing letter is the last letter in an eight-letter word) to seven below the existing letter (in which case the existing letter is the first letter in an eight-letter word) with the existing letter fixed in the 8th position. The multipliers are the same as in previous problems:<pre> * D: double word
 * T: triple word
 * Q: quadruple word
 * d: double letter
 * t: triple letter
 * q: quadruple letter</pre>The center multiplier square will be left blank, since it's already covered by a tile. Write a routine to determine the highest scoring word(s) based on the multiplier squares.Once again, you will be provided a cell array of strings containing all possible words based on the existing letter and the letters on your tray. In addition to providing the highest score, also provide the word(s) that achieve that score in a cell array. See the test suite for examples. Due to high-scoring tiles, the highest score may not be achieved by the longest word(s).Related problems:Previous problem: 10 - <a href = "https://www.mathworks.com/matlabcentral/cody/problems/3082-scrabble-scores-10">Word score optimization (known letter)</a>. Next problem: 12 - <a href = "https://www.mathworks.com/matlabcentral/cody/problems/3097-scrabble-scores-12">Word score optimization (first word)</a>.

This problem builds on the previous problem, wherein you were provided a letter of an existing word on the board and from which you played a word to find the highest scoring word. See the previous problem for more details.

Now, you will be provided a multiplier character array that represents the fifteen possible squares that can be played on, ranging from seven above the existing letter (in which case the existing letter is the last letter in an eight-letter word) to seven below the existing letter (in which case the existing letter is the first letter in an eight-letter word) with the existing letter fixed in the 8th position. The multipliers are the same as in previous problems:

* D: double word
 * T: triple word
 * Q: quadruple word
 * d: double letter
 * t: triple letter
 * q: quadruple letter

The center multiplier square will be left blank, since it's already covered by a tile. Write a routine to determine the highest scoring word(s) based on the multiplier squares.

Once again, you will be provided a cell array of strings containing all possible words based on the existing letter and the letters on your tray. In addition to providing the highest score, also provide the word(s) that achieve that score in a cell array. See the test suite for examples. Due to high-scoring tiles, the highest score may not be achieved by the longest word(s).

Solution Stats

49 Solutions
21 Solvers

Last Solution submitted on Dec 27, 2022

Last 200 Solutions

Problem Comments

7 Comments

7 Comments

Show 4 older comments

rifat on 17 Mar 2015

grant, can you please add an example to explain how you dealt with the multiplier and 'existing_letter' in this problem?

Jan Orwat on 17 Mar 2015

It seems that "existing_letter" is fixed on 8th position.

rifat on 17 Mar 2015

@Jan, thanks :)

goc3 on 17 Mar 2015

That is correct. I've added the 8th position fixed point to the description. I've also fixed one of the multiplier strings in the test cases that was accidentally 16 instead of 15 characters long (it's hard to distinguish between three versus four spaces).

Peng Liu on 27 Dec 2015

Are you also assuming that the length of the word is no more that 8 if the "existing_letter" is either the first or the last letter of the word? Also, if the "existing_letter" is the middle letter of the word, then the length or the word is assumed to be no more than 15. Is that right?

goc3 on 28 Dec 2015

The assumption (I thought this was explicitly stated in a previous problem) is that we're following Scrabble rules, which involve seven tiles per player. That being the case, eight letters is the longest word that can be played, and the existing letter can range anywhere from the first to the last letter of the word. The 15-character window simply represents all the tiles that can be played on (existing tile plus seven to each side). The word will be played at some point in that 15-character window, though no longer than eight characters.

Peng Liu on 28 Dec 2015

Thanks for the clarification!

Solution Comments

Show comments

Problem Recent Solvers21

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 3084. Scrabble Scores - 11

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers21

Suggested Problems

More from this Author139

Problem Tags

Community Treasure Hunt

Problem 3084. Scrabble Scores - 11

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers21

Suggested Problems

More from this Author139

Problem Tags

Community Treasure Hunt

Players