What is the highest possible scrabble score for placing a single tile
21
$begingroup$
What is the highest possible score a player can make in a turn by placing a single tile? Assume language is English, using standard North American rules.
scrabble
edited Mar 22 at 11:36
noedne
8,27412364
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
$endgroup$
add a comment |
21
$begingroup$
What is the highest possible score a player can make in a turn by placing a single tile? Assume language is English, using standard North American rules.
scrabble
edited Mar 22 at 11:36
noedne
8,27412364
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
$endgroup$
$begingroup$
You might be interested in reading interested in reading some of the comments on this post: recordsetter.com/world-record/…
$endgroup$
– Matt
Mar 21 at 18:24
$begingroup$
Can we assume that the tiles already on the board are exactly as we want them?
$endgroup$
– Hugh
Mar 21 at 18:30
$begingroup$
@doppelgreener Norh should you - it's been fixed now ;-)
$endgroup$
– Rand al'Thor
Mar 22 at 13:24
$begingroup$
@Randal'Thor Many hanks!
$endgroup$
– doppelgreener
Mar 22 at 13:26
add a comment |
21
21
21
2
$begingroup$
What is the highest possible score a player can make in a turn by placing a single tile? Assume language is English, using standard North American rules.
scrabble
edited Mar 22 at 11:36
noedne
8,27412364
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
$endgroup$
What is the highest possible score a player can make in a turn by placing a single tile? Assume language is English, using standard North American rules.
scrabble
scrabble
edited Mar 22 at 11:36
noedne
8,27412364
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
edited Mar 22 at 11:36
noedne
8,27412364
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
edited Mar 22 at 11:36
noedne
8,27412364
edited Mar 22 at 11:36
noedne
8,27412364
edited Mar 22 at 11:36
noedne
8,27412364
8,27412364
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
asked Mar 21 at 18:21
user3294068user3294068
5,7641629
5,7641629
$begingroup$
You might be interested in reading interested in reading some of the comments on this post: recordsetter.com/world-record/…
$endgroup$
– Matt
Mar 21 at 18:24
$begingroup$
Can we assume that the tiles already on the board are exactly as we want them?
$endgroup$
– Hugh
Mar 21 at 18:30
$begingroup$
@doppelgreener Norh should you - it's been fixed now ;-)
$endgroup$
– Rand al'Thor
Mar 22 at 13:24
$begingroup$
@Randal'Thor Many hanks!
$endgroup$
– doppelgreener
Mar 22 at 13:26
add a comment |
$begingroup$
You might be interested in reading interested in reading some of the comments on this post: recordsetter.com/world-record/…
$endgroup$
– Matt
Mar 21 at 18:24
$begingroup$
Can we assume that the tiles already on the board are exactly as we want them?
$endgroup$
– Hugh
Mar 21 at 18:30
$begingroup$
@doppelgreener Norh should you - it's been fixed now ;-)
$endgroup$
– Rand al'Thor
Mar 22 at 13:24
$begingroup$
@Randal'Thor Many hanks!
$endgroup$
– doppelgreener
Mar 22 at 13:26
$begingroup$
You might be interested in reading interested in reading some of the comments on this post: recordsetter.com/world-record/…
$endgroup$
– Matt
Mar 21 at 18:24
$begingroup$
You might be interested in reading interested in reading some of the comments on this post: recordsetter.com/world-record/…
$endgroup$
– Matt
Mar 21 at 18:24
$begingroup$
Can we assume that the tiles already on the board are exactly as we want them?
$endgroup$
– Hugh
Mar 21 at 18:30
$begingroup$
Can we assume that the tiles already on the board are exactly as we want them?
$endgroup$
– Hugh
Mar 21 at 18:30
$begingroup$
@doppelgreener Norh should you - it's been fixed now ;-)
$endgroup$
– Rand al'Thor
Mar 22 at 13:24
$begingroup$
@doppelgreener Norh should you - it's been fixed now ;-)
$endgroup$
– Rand al'Thor
Mar 22 at 13:24
$begingroup$
@Randal'Thor Many hanks!
$endgroup$
– doppelgreener
Mar 22 at 13:26
$begingroup$
@Randal'Thor Many hanks!
$endgroup$
– doppelgreener
Mar 22 at 13:26
add a comment |
2 Answers
2
active
oldest
votes
35
$begingroup$
According to this Quora question, the best you can do using the North American Scrabble dictionary is CRYPTO(Z)OOLOGY and QUART(Z), giving a total of 171 points. The setup should look something like this:
...However, that's not the best you can do. We're looking at the highest possible score.
The rules of Scrabble do not prevent players from playing invalid words. There are rules for challenging someone you think has played an invalid word, and if the challenge is correct, the play will be reversed. But if players decide not to challenge, the word remains.
So, with particularly cooperative (or particularly stupid) players, the best you can do...
...is 303 points.
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
$endgroup$
6
$begingroup$
@Brandon_J Probably, but the latter option is not against the rules of the game, no matter what language you're playing in. If nothing else, it's worth including as an option.
$endgroup$
– Deusovi♦
Mar 21 at 19:20
6
$begingroup$
(Rubio changes PSE username to QJXKFFHZHVVWWYY)
$endgroup$
– Rubio♦
Mar 21 at 19:55
2
$begingroup$
why are the E's necessary in the 2nd example? Diagonal words don't count right?
$endgroup$
– Aequitas
Mar 22 at 1:05
6
$begingroup$
@Aequitas Because otherwise, the board would have 3 disconnected pieces prior to the move (which is not possible).
$endgroup$
– John Doe
Mar 22 at 1:34
19
$begingroup$
(If anyone is wondering, "oology" is the studying of bird eggs, nests and breeding behaviour.)
$endgroup$
– BruceWayne
Mar 22 at 2:09
|
show 9 more comments
19
$begingroup$
In N-Tile Scrabble Records (Word Ways, May 1983, p.80), Kyle Corbin gives the following, for 231 points. All words can be found in Webster's Third.
A B C D E F G H I J K L M N O
1 # . . + . . . # . . . + . . Q 1
2 . = . . . * . . . * . . . = U 2
3 . . = . . . + . + . . . = . I 3
4 + . . = . . . + . . . = . . C 4
5 . . . . = . . . . . = . . . K 5
6 . * . . . * . . . * . . . * S 6
7 . . + . . . + . + . . . + . I 7
8 # . . + . . . S N O W B A L L 8
9 . . + . . . + . + . . . + . V 9
10 . * . . . * . . . * . . . * E 10
11 . . . . = . . . . . = . . . R 11
12 + . . = . . . + . . . = . . I 12
13 . . = . . . + . + . . . = . N 13
14 . = . . . * . . . * . . E R G 14
15 H Y D R O X Y B E N Z E N E # 15
A B C D E F G H I J K L M N O
An S tile is placed into the # in the bottom right corner where there is a 3× word bonus.
(HYDROXYBENZENE)S/(QUICKSILVERING)S for 231 points.
edited Mar 22 at 11:19
doppelgreener
298213
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
$endgroup$
3
$begingroup$
That's pretty cool, but wouldn't work for tournament scrabble according to scrabble.merriam.com
$endgroup$
– James
Mar 22 at 12:21
1
$begingroup$
@James: As noted on the other answer, it will work if nobody challenges it. One problem historically with the OSPD3 was that it didn't include words that are longer than eight letters and are not formed by adding common prefix or suffix to a words of eight letters or less. As noted in the introduction, one would have to look in another dictionary to check the validity of a word like "petroleum", since "eum" is not a common suffix. Does the aformentioned dictionary claim to exhaustively list all valid words of all lengths up to 15, regardless of stem length?
$endgroup$
– supercat
Mar 22 at 15:59
$begingroup$
Hi @supercat: As far as I can tell, the dictionary I linked to exhaustively lists all "valid" words, where "valid" means "legal in tournament Scrabble". I also notice that there are some 15-letter words in that dictionary, including "cryptozoologist" and "cryptozoologies".
$endgroup$
– James
Mar 22 at 17:10
$begingroup$
@James: Unless things have changed, any played word that is not challenged is valid, and this is actually a significant aspect of strategy. Even if one would expect one's opponent to believe a word is probably invalid, one might expect the opponent to refrain from challenging in cases where the downside risk would be too great.
$endgroup$
– supercat
Mar 22 at 17:34
$begingroup$
@supercat: I totally agree with your last comment. I thought when you used the word "valid" in the last sentence of your first comment above, you meant "valid if challenged". After all, you discussed using a dictionary to "... check the validity of a word ...". Why would you use a dictionary if any combination of letters were valid.
$endgroup$
– James
Mar 22 at 17:38
|
show 3 more comments
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80897%2fwhat-is-the-highest-possible-scrabble-score-for-placing-a-single-tile%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
35
$begingroup$
According to this Quora question, the best you can do using the North American Scrabble dictionary is CRYPTO(Z)OOLOGY and QUART(Z), giving a total of 171 points. The setup should look something like this:
...However, that's not the best you can do. We're looking at the highest possible score.
The rules of Scrabble do not prevent players from playing invalid words. There are rules for challenging someone you think has played an invalid word, and if the challenge is correct, the play will be reversed. But if players decide not to challenge, the word remains.
So, with particularly cooperative (or particularly stupid) players, the best you can do...
...is 303 points.
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
$endgroup$
6
$begingroup$
@Brandon_J Probably, but the latter option is not against the rules of the game, no matter what language you're playing in. If nothing else, it's worth including as an option.
$endgroup$
– Deusovi♦
Mar 21 at 19:20
6
$begingroup$
(Rubio changes PSE username to QJXKFFHZHVVWWYY)
$endgroup$
– Rubio♦
Mar 21 at 19:55
2
$begingroup$
why are the E's necessary in the 2nd example? Diagonal words don't count right?
$endgroup$
– Aequitas
Mar 22 at 1:05
6
$begingroup$
@Aequitas Because otherwise, the board would have 3 disconnected pieces prior to the move (which is not possible).
$endgroup$
– John Doe
Mar 22 at 1:34
19
$begingroup$
(If anyone is wondering, "oology" is the studying of bird eggs, nests and breeding behaviour.)
$endgroup$
– BruceWayne
Mar 22 at 2:09
|
show 9 more comments
35
$begingroup$
According to this Quora question, the best you can do using the North American Scrabble dictionary is CRYPTO(Z)OOLOGY and QUART(Z), giving a total of 171 points. The setup should look something like this:
...However, that's not the best you can do. We're looking at the highest possible score.
The rules of Scrabble do not prevent players from playing invalid words. There are rules for challenging someone you think has played an invalid word, and if the challenge is correct, the play will be reversed. But if players decide not to challenge, the word remains.
So, with particularly cooperative (or particularly stupid) players, the best you can do...
...is 303 points.
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
$endgroup$
6
$begingroup$
@Brandon_J Probably, but the latter option is not against the rules of the game, no matter what language you're playing in. If nothing else, it's worth including as an option.
$endgroup$
– Deusovi♦
Mar 21 at 19:20
6
$begingroup$
(Rubio changes PSE username to QJXKFFHZHVVWWYY)
$endgroup$
– Rubio♦
Mar 21 at 19:55
2
$begingroup$
why are the E's necessary in the 2nd example? Diagonal words don't count right?
$endgroup$
– Aequitas
Mar 22 at 1:05
6
$begingroup$
@Aequitas Because otherwise, the board would have 3 disconnected pieces prior to the move (which is not possible).
$endgroup$
– John Doe
Mar 22 at 1:34
19
$begingroup$
(If anyone is wondering, "oology" is the studying of bird eggs, nests and breeding behaviour.)
$endgroup$
– BruceWayne
Mar 22 at 2:09
|
show 9 more comments
35
35
35
$begingroup$
According to this Quora question, the best you can do using the North American Scrabble dictionary is CRYPTO(Z)OOLOGY and QUART(Z), giving a total of 171 points. The setup should look something like this:
...However, that's not the best you can do. We're looking at the highest possible score.
The rules of Scrabble do not prevent players from playing invalid words. There are rules for challenging someone you think has played an invalid word, and if the challenge is correct, the play will be reversed. But if players decide not to challenge, the word remains.
So, with particularly cooperative (or particularly stupid) players, the best you can do...
...is 303 points.
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
$endgroup$
According to this Quora question, the best you can do using the North American Scrabble dictionary is CRYPTO(Z)OOLOGY and QUART(Z), giving a total of 171 points. The setup should look something like this:
...However, that's not the best you can do. We're looking at the highest possible score.
The rules of Scrabble do not prevent players from playing invalid words. There are rules for challenging someone you think has played an invalid word, and if the challenge is correct, the play will be reversed. But if players decide not to challenge, the word remains.
So, with particularly cooperative (or particularly stupid) players, the best you can do...
...is 303 points.
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
answered Mar 21 at 19:13
Deusovi♦Deusovi
62.5k6215269
62.5k6215269
6
$begingroup$
@Brandon_J Probably, but the latter option is not against the rules of the game, no matter what language you're playing in. If nothing else, it's worth including as an option.
$endgroup$
– Deusovi♦
Mar 21 at 19:20
6
$begingroup$
(Rubio changes PSE username to QJXKFFHZHVVWWYY)
$endgroup$
– Rubio♦
Mar 21 at 19:55
2
$begingroup$
why are the E's necessary in the 2nd example? Diagonal words don't count right?
$endgroup$
– Aequitas
Mar 22 at 1:05
6
$begingroup$
@Aequitas Because otherwise, the board would have 3 disconnected pieces prior to the move (which is not possible).
$endgroup$
– John Doe
Mar 22 at 1:34
19
$begingroup$
(If anyone is wondering, "oology" is the studying of bird eggs, nests and breeding behaviour.)
$endgroup$
– BruceWayne
Mar 22 at 2:09
|
show 9 more comments
6
$begingroup$
@Brandon_J Probably, but the latter option is not against the rules of the game, no matter what language you're playing in. If nothing else, it's worth including as an option.
$endgroup$
– Deusovi♦
Mar 21 at 19:20
6
$begingroup$
(Rubio changes PSE username to QJXKFFHZHVVWWYY)
$endgroup$
– Rubio♦
Mar 21 at 19:55
2
$begingroup$
why are the E's necessary in the 2nd example? Diagonal words don't count right?
$endgroup$
– Aequitas
Mar 22 at 1:05
6
$begingroup$
@Aequitas Because otherwise, the board would have 3 disconnected pieces prior to the move (which is not possible).
$endgroup$
– John Doe
Mar 22 at 1:34
19
$begingroup$
(If anyone is wondering, "oology" is the studying of bird eggs, nests and breeding behaviour.)
$endgroup$
– BruceWayne
Mar 22 at 2:09
6
6
$begingroup$
@Brandon_J Probably, but the latter option is not against the rules of the game, no matter what language you're playing in. If nothing else, it's worth including as an option.
$endgroup$
– Deusovi♦
Mar 21 at 19:20
$begingroup$
@Brandon_J Probably, but the latter option is not against the rules of the game, no matter what language you're playing in. If nothing else, it's worth including as an option.
$endgroup$
– Deusovi♦
Mar 21 at 19:20
6
6
$begingroup$
(Rubio changes PSE username to QJXKFFHZHVVWWYY)
$endgroup$
– Rubio♦
Mar 21 at 19:55
$begingroup$
(Rubio changes PSE username to QJXKFFHZHVVWWYY)
$endgroup$
– Rubio♦
Mar 21 at 19:55
2
2
$begingroup$
why are the E's necessary in the 2nd example? Diagonal words don't count right?
$endgroup$
– Aequitas
Mar 22 at 1:05
$begingroup$
why are the E's necessary in the 2nd example? Diagonal words don't count right?
$endgroup$
– Aequitas
Mar 22 at 1:05
6
6
$begingroup$
@Aequitas Because otherwise, the board would have 3 disconnected pieces prior to the move (which is not possible).
$endgroup$
– John Doe
Mar 22 at 1:34
$begingroup$
@Aequitas Because otherwise, the board would have 3 disconnected pieces prior to the move (which is not possible).
$endgroup$
– John Doe
Mar 22 at 1:34
19
19
$begingroup$
(If anyone is wondering, "oology" is the studying of bird eggs, nests and breeding behaviour.)
$endgroup$
– BruceWayne
Mar 22 at 2:09
$begingroup$
(If anyone is wondering, "oology" is the studying of bird eggs, nests and breeding behaviour.)
$endgroup$
– BruceWayne
Mar 22 at 2:09
|
show 9 more comments
19
$begingroup$
In N-Tile Scrabble Records (Word Ways, May 1983, p.80), Kyle Corbin gives the following, for 231 points. All words can be found in Webster's Third.
A B C D E F G H I J K L M N O
1 # . . + . . . # . . . + . . Q 1
2 . = . . . * . . . * . . . = U 2
3 . . = . . . + . + . . . = . I 3
4 + . . = . . . + . . . = . . C 4
5 . . . . = . . . . . = . . . K 5
6 . * . . . * . . . * . . . * S 6
7 . . + . . . + . + . . . + . I 7
8 # . . + . . . S N O W B A L L 8
9 . . + . . . + . + . . . + . V 9
10 . * . . . * . . . * . . . * E 10
11 . . . . = . . . . . = . . . R 11
12 + . . = . . . + . . . = . . I 12
13 . . = . . . + . + . . . = . N 13
14 . = . . . * . . . * . . E R G 14
15 H Y D R O X Y B E N Z E N E # 15
A B C D E F G H I J K L M N O
An S tile is placed into the # in the bottom right corner where there is a 3× word bonus.
(HYDROXYBENZENE)S/(QUICKSILVERING)S for 231 points.
edited Mar 22 at 11:19
doppelgreener
298213
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
$endgroup$
3
$begingroup$
That's pretty cool, but wouldn't work for tournament scrabble according to scrabble.merriam.com
$endgroup$
– James
Mar 22 at 12:21
1
$begingroup$
@James: As noted on the other answer, it will work if nobody challenges it. One problem historically with the OSPD3 was that it didn't include words that are longer than eight letters and are not formed by adding common prefix or suffix to a words of eight letters or less. As noted in the introduction, one would have to look in another dictionary to check the validity of a word like "petroleum", since "eum" is not a common suffix. Does the aformentioned dictionary claim to exhaustively list all valid words of all lengths up to 15, regardless of stem length?
$endgroup$
– supercat
Mar 22 at 15:59
$begingroup$
Hi @supercat: As far as I can tell, the dictionary I linked to exhaustively lists all "valid" words, where "valid" means "legal in tournament Scrabble". I also notice that there are some 15-letter words in that dictionary, including "cryptozoologist" and "cryptozoologies".
$endgroup$
– James
Mar 22 at 17:10
$begingroup$
@James: Unless things have changed, any played word that is not challenged is valid, and this is actually a significant aspect of strategy. Even if one would expect one's opponent to believe a word is probably invalid, one might expect the opponent to refrain from challenging in cases where the downside risk would be too great.
$endgroup$
– supercat
Mar 22 at 17:34
$begingroup$
@supercat: I totally agree with your last comment. I thought when you used the word "valid" in the last sentence of your first comment above, you meant "valid if challenged". After all, you discussed using a dictionary to "... check the validity of a word ...". Why would you use a dictionary if any combination of letters were valid.
$endgroup$
– James
Mar 22 at 17:38
|
show 3 more comments
19
$begingroup$
In N-Tile Scrabble Records (Word Ways, May 1983, p.80), Kyle Corbin gives the following, for 231 points. All words can be found in Webster's Third.
A B C D E F G H I J K L M N O
1 # . . + . . . # . . . + . . Q 1
2 . = . . . * . . . * . . . = U 2
3 . . = . . . + . + . . . = . I 3
4 + . . = . . . + . . . = . . C 4
5 . . . . = . . . . . = . . . K 5
6 . * . . . * . . . * . . . * S 6
7 . . + . . . + . + . . . + . I 7
8 # . . + . . . S N O W B A L L 8
9 . . + . . . + . + . . . + . V 9
10 . * . . . * . . . * . . . * E 10
11 . . . . = . . . . . = . . . R 11
12 + . . = . . . + . . . = . . I 12
13 . . = . . . + . + . . . = . N 13
14 . = . . . * . . . * . . E R G 14
15 H Y D R O X Y B E N Z E N E # 15
A B C D E F G H I J K L M N O
An S tile is placed into the # in the bottom right corner where there is a 3× word bonus.
(HYDROXYBENZENE)S/(QUICKSILVERING)S for 231 points.
edited Mar 22 at 11:19
doppelgreener
298213
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
$endgroup$
3
$begingroup$
That's pretty cool, but wouldn't work for tournament scrabble according to scrabble.merriam.com
$endgroup$
– James
Mar 22 at 12:21
1
$begingroup$
@James: As noted on the other answer, it will work if nobody challenges it. One problem historically with the OSPD3 was that it didn't include words that are longer than eight letters and are not formed by adding common prefix or suffix to a words of eight letters or less. As noted in the introduction, one would have to look in another dictionary to check the validity of a word like "petroleum", since "eum" is not a common suffix. Does the aformentioned dictionary claim to exhaustively list all valid words of all lengths up to 15, regardless of stem length?
$endgroup$
– supercat
Mar 22 at 15:59
$begingroup$
Hi @supercat: As far as I can tell, the dictionary I linked to exhaustively lists all "valid" words, where "valid" means "legal in tournament Scrabble". I also notice that there are some 15-letter words in that dictionary, including "cryptozoologist" and "cryptozoologies".
$endgroup$
– James
Mar 22 at 17:10
$begingroup$
@James: Unless things have changed, any played word that is not challenged is valid, and this is actually a significant aspect of strategy. Even if one would expect one's opponent to believe a word is probably invalid, one might expect the opponent to refrain from challenging in cases where the downside risk would be too great.
$endgroup$
– supercat
Mar 22 at 17:34
$begingroup$
@supercat: I totally agree with your last comment. I thought when you used the word "valid" in the last sentence of your first comment above, you meant "valid if challenged". After all, you discussed using a dictionary to "... check the validity of a word ...". Why would you use a dictionary if any combination of letters were valid.
$endgroup$
– James
Mar 22 at 17:38
|
show 3 more comments
19
19
19
$begingroup$
In N-Tile Scrabble Records (Word Ways, May 1983, p.80), Kyle Corbin gives the following, for 231 points. All words can be found in Webster's Third.
A B C D E F G H I J K L M N O
1 # . . + . . . # . . . + . . Q 1
2 . = . . . * . . . * . . . = U 2
3 . . = . . . + . + . . . = . I 3
4 + . . = . . . + . . . = . . C 4
5 . . . . = . . . . . = . . . K 5
6 . * . . . * . . . * . . . * S 6
7 . . + . . . + . + . . . + . I 7
8 # . . + . . . S N O W B A L L 8
9 . . + . . . + . + . . . + . V 9
10 . * . . . * . . . * . . . * E 10
11 . . . . = . . . . . = . . . R 11
12 + . . = . . . + . . . = . . I 12
13 . . = . . . + . + . . . = . N 13
14 . = . . . * . . . * . . E R G 14
15 H Y D R O X Y B E N Z E N E # 15
A B C D E F G H I J K L M N O
An S tile is placed into the # in the bottom right corner where there is a 3× word bonus.
(HYDROXYBENZENE)S/(QUICKSILVERING)S for 231 points.
edited Mar 22 at 11:19
doppelgreener
298213
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
$endgroup$
In N-Tile Scrabble Records (Word Ways, May 1983, p.80), Kyle Corbin gives the following, for 231 points. All words can be found in Webster's Third.
A B C D E F G H I J K L M N O
1 # . . + . . . # . . . + . . Q 1
2 . = . . . * . . . * . . . = U 2
3 . . = . . . + . + . . . = . I 3
4 + . . = . . . + . . . = . . C 4
5 . . . . = . . . . . = . . . K 5
6 . * . . . * . . . * . . . * S 6
7 . . + . . . + . + . . . + . I 7
8 # . . + . . . S N O W B A L L 8
9 . . + . . . + . + . . . + . V 9
10 . * . . . * . . . * . . . * E 10
11 . . . . = . . . . . = . . . R 11
12 + . . = . . . + . . . = . . I 12
13 . . = . . . + . + . . . = . N 13
14 . = . . . * . . . * . . E R G 14
15 H Y D R O X Y B E N Z E N E # 15
A B C D E F G H I J K L M N O
An S tile is placed into the # in the bottom right corner where there is a 3× word bonus.
(HYDROXYBENZENE)S/(QUICKSILVERING)S for 231 points.
edited Mar 22 at 11:19
doppelgreener
298213
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
edited Mar 22 at 11:19
doppelgreener
298213
edited Mar 22 at 11:19
doppelgreener
298213
edited Mar 22 at 11:19
doppelgreener
298213
298213
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
answered Mar 22 at 7:37
Rosie FRosie F
5,9382944
5,9382944
3
$begingroup$
That's pretty cool, but wouldn't work for tournament scrabble according to scrabble.merriam.com
$endgroup$
– James
Mar 22 at 12:21
1
$begingroup$
@James: As noted on the other answer, it will work if nobody challenges it. One problem historically with the OSPD3 was that it didn't include words that are longer than eight letters and are not formed by adding common prefix or suffix to a words of eight letters or less. As noted in the introduction, one would have to look in another dictionary to check the validity of a word like "petroleum", since "eum" is not a common suffix. Does the aformentioned dictionary claim to exhaustively list all valid words of all lengths up to 15, regardless of stem length?
$endgroup$
– supercat
Mar 22 at 15:59
$begingroup$
Hi @supercat: As far as I can tell, the dictionary I linked to exhaustively lists all "valid" words, where "valid" means "legal in tournament Scrabble". I also notice that there are some 15-letter words in that dictionary, including "cryptozoologist" and "cryptozoologies".
$endgroup$
– James
Mar 22 at 17:10
$begingroup$
@James: Unless things have changed, any played word that is not challenged is valid, and this is actually a significant aspect of strategy. Even if one would expect one's opponent to believe a word is probably invalid, one might expect the opponent to refrain from challenging in cases where the downside risk would be too great.
$endgroup$
– supercat
Mar 22 at 17:34
$begingroup$
@supercat: I totally agree with your last comment. I thought when you used the word "valid" in the last sentence of your first comment above, you meant "valid if challenged". After all, you discussed using a dictionary to "... check the validity of a word ...". Why would you use a dictionary if any combination of letters were valid.
$endgroup$
– James
Mar 22 at 17:38
|
show 3 more comments
3
$begingroup$
That's pretty cool, but wouldn't work for tournament scrabble according to scrabble.merriam.com
$endgroup$
– James
Mar 22 at 12:21
1
$begingroup$
@James: As noted on the other answer, it will work if nobody challenges it. One problem historically with the OSPD3 was that it didn't include words that are longer than eight letters and are not formed by adding common prefix or suffix to a words of eight letters or less. As noted in the introduction, one would have to look in another dictionary to check the validity of a word like "petroleum", since "eum" is not a common suffix. Does the aformentioned dictionary claim to exhaustively list all valid words of all lengths up to 15, regardless of stem length?
$endgroup$
– supercat
Mar 22 at 15:59
$begingroup$
Hi @supercat: As far as I can tell, the dictionary I linked to exhaustively lists all "valid" words, where "valid" means "legal in tournament Scrabble". I also notice that there are some 15-letter words in that dictionary, including "cryptozoologist" and "cryptozoologies".
$endgroup$
– James
Mar 22 at 17:10
$begingroup$
@James: Unless things have changed, any played word that is not challenged is valid, and this is actually a significant aspect of strategy. Even if one would expect one's opponent to believe a word is probably invalid, one might expect the opponent to refrain from challenging in cases where the downside risk would be too great.
$endgroup$
– supercat
Mar 22 at 17:34
$begingroup$
@supercat: I totally agree with your last comment. I thought when you used the word "valid" in the last sentence of your first comment above, you meant "valid if challenged". After all, you discussed using a dictionary to "... check the validity of a word ...". Why would you use a dictionary if any combination of letters were valid.
$endgroup$
– James
Mar 22 at 17:38
3
3
$begingroup$
That's pretty cool, but wouldn't work for tournament scrabble according to scrabble.merriam.com
$endgroup$
– James
Mar 22 at 12:21
$begingroup$
That's pretty cool, but wouldn't work for tournament scrabble according to scrabble.merriam.com
$endgroup$
– James
Mar 22 at 12:21
1
1
$begingroup$
@James: As noted on the other answer, it will work if nobody challenges it. One problem historically with the OSPD3 was that it didn't include words that are longer than eight letters and are not formed by adding common prefix or suffix to a words of eight letters or less. As noted in the introduction, one would have to look in another dictionary to check the validity of a word like "petroleum", since "eum" is not a common suffix. Does the aformentioned dictionary claim to exhaustively list all valid words of all lengths up to 15, regardless of stem length?
$endgroup$
– supercat
Mar 22 at 15:59
$begingroup$
@James: As noted on the other answer, it will work if nobody challenges it. One problem historically with the OSPD3 was that it didn't include words that are longer than eight letters and are not formed by adding common prefix or suffix to a words of eight letters or less. As noted in the introduction, one would have to look in another dictionary to check the validity of a word like "petroleum", since "eum" is not a common suffix. Does the aformentioned dictionary claim to exhaustively list all valid words of all lengths up to 15, regardless of stem length?
$endgroup$
– supercat
Mar 22 at 15:59
$begingroup$
Hi @supercat: As far as I can tell, the dictionary I linked to exhaustively lists all "valid" words, where "valid" means "legal in tournament Scrabble". I also notice that there are some 15-letter words in that dictionary, including "cryptozoologist" and "cryptozoologies".
$endgroup$
– James
Mar 22 at 17:10
$begingroup$
Hi @supercat: As far as I can tell, the dictionary I linked to exhaustively lists all "valid" words, where "valid" means "legal in tournament Scrabble". I also notice that there are some 15-letter words in that dictionary, including "cryptozoologist" and "cryptozoologies".
$endgroup$
– James
Mar 22 at 17:10
$begingroup$
@James: Unless things have changed, any played word that is not challenged is valid, and this is actually a significant aspect of strategy. Even if one would expect one's opponent to believe a word is probably invalid, one might expect the opponent to refrain from challenging in cases where the downside risk would be too great.
$endgroup$
– supercat
Mar 22 at 17:34
$begingroup$
@James: Unless things have changed, any played word that is not challenged is valid, and this is actually a significant aspect of strategy. Even if one would expect one's opponent to believe a word is probably invalid, one might expect the opponent to refrain from challenging in cases where the downside risk would be too great.
$endgroup$
– supercat
Mar 22 at 17:34
$begingroup$
@supercat: I totally agree with your last comment. I thought when you used the word "valid" in the last sentence of your first comment above, you meant "valid if challenged". After all, you discussed using a dictionary to "... check the validity of a word ...". Why would you use a dictionary if any combination of letters were valid.
$endgroup$
– James
Mar 22 at 17:38
$begingroup$
@supercat: I totally agree with your last comment. I thought when you used the word "valid" in the last sentence of your first comment above, you meant "valid if challenged". After all, you discussed using a dictionary to "... check the validity of a word ...". Why would you use a dictionary if any combination of letters were valid.
$endgroup$
– James
Mar 22 at 17:38
|
show 3 more comments
draft saved
draft discarded
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80897%2fwhat-is-the-highest-possible-scrabble-score-for-placing-a-single-tile%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
You might be interested in reading interested in reading some of the comments on this post: recordsetter.com/world-record/…
$endgroup$
– Matt
Mar 21 at 18:24
$begingroup$
Can we assume that the tiles already on the board are exactly as we want them?
$endgroup$
– Hugh
Mar 21 at 18:30
$begingroup$
@doppelgreener Norh should you - it's been fixed now ;-)
$endgroup$
– Rand al'Thor
Mar 22 at 13:24
$begingroup$
@Randal'Thor Many hanks!
$endgroup$
– doppelgreener
Mar 22 at 13:26