|
|
| Author |
Message |
| 6 new of 905 responses total. |
aruba
|
|
response 900 of 905:
| 
Feb 7 16:51 UTC 2001 |
access
|
kentn
|
|
response 901 of 905:
|
Feb 8 12:15 UTC 2001 |
gnatty 2 (prp)
access 1 (aruba)
|
prp
|
|
response 902 of 905:
|
Feb 9 19:12 UTC 2001 |
scatch
Couldn't find it in m-w.com, but I think I can prove it.
|
aruba
|
|
response 903 of 905:
|
Feb 9 23:03 UTC 2001 |
Indeed, here's a proof:
prints 0 (prp)
swatch 5 (aruba)
access 1 (aruba)
stings 1 (aruba)
prance 2 (albaugh)
gnatty 2 (prp)
score(prints) = 0 ==> score(-----s) = 0, so
1 = score(access) = score(acces-) + score(-----s) = score(acces-).
swatch and acces- have no letters in common, but their scores sum to 6, so
all correct letters must come from one of them. (Which implies right off the
bat that score(-----h) = 1.) So we can compare words with
score(swatch) = 5
score(acces-) = 1
and throw out all letters that don't match one word or the other:
score(stings) = score(s-----) ==> score(s-----) = 1
score(prance) = score(--a-c-) ==> score(--a-c-) = 2
score(gnatty) = score(--at--) ==> score(--at--) = 2
So score(s-atch) = 5, ==> score(-w----) = 0 ==> score(-c----) = 1.
So score(scatch) = 6.
|
kentn
|
|
response 904 of 905:
|
Feb 10 18:55 UTC 2001 |
scatch 6 (prp) ---> Ding! Ding! Ding! Winner!
From Webster's Revised Unabridged Dictionary (1913) [web1913]:
Scatch \Scatch\, n. [F. escache.]
A kind of bit for the bridle of a horse; -- called also
{scatchmouth}. --Bailey.
|
prp
|
|
response 905 of 905:
|
Feb 12 16:33 UTC 2001 |
As this item now has over nine hundred responses, I have started the ninth
edition. It is Puzzle:149.
|
