# What is the highest game score theoretically possible in Scrabble using 1 player and the International Scrabble Dictionary?

This is one for simulation and some guesses on the strategy to used e.g. is it best to always get the bonus every turn or do the most combinations even if it doesn't use up all the letters every turn.

You don't need to definitively prove your answer is the highest (which is way too hard) just come up with a reasonable answer using a particular strategy

Defining a strategy (such the following) would reduce the computing power needed: Long word: Find all the 8 and 14 letter words that are respectively 1 and 7 letters longer than 7 letter words. Determine what subsets have a long continuous net of those words together. Remove those that use more of the individual letters than the Scrabble set allows. Finally lay the net on the board as a standard one player game and determine the score.

• This is a very interesting question to me, but I doubt that anyone can currently PROVE what the highest theoretically possible score is. I imagine that there is no definitive answer to this question possible with our current computing power. Sep 10, 2019 at 11:34
• It's not technically dependent on the strategy: given sufficient computing power (and time), this can be solved explicitly. Sep 10, 2019 at 11:34
• All that needs to be done is agree on the dictionary. ðŸ˜‚ Sep 10, 2019 at 12:04
• @LeppyR64 That's why all competitive Scrabble is played with a standard word list, which human players do their best to memorize. Sep 12, 2019 at 18:49
• In tournament rules, words stand if unchallenged. Ditto if the first word isn't placed on the centre star. One could thus place two invalid triple-triple-triples and one triple-triple-double and not challenge oneself. How to distribute the tiles is left as an exercise for the reader. Jan 21 at 12:01