 |
+ + |  |
+
Abigail Freebie + Moira Bruiser + Samantha Oriflamme |
+ + | Elihu Leather + Bobby Morrow + Hal Cleveland |
+
| + | + | + |
page 1 front |
+ + | page 1 back |
+
The complete solution to this puzzle is not available.
+
We know that the final answer is supposed to be FOOTBALL PLAY,
+ formed from the three answers FOOT, BALL, and PLAY to the clues
+ formed by the common letters in the pairs. Some possible answers
+ are printed after each clue below. Bold indicates a word used in a
+ possible pairing. Words struck through have no possible pairing.
+
|
+ Clues + Character appearing twice on TNG, once on DS9 VASH + Competitions, of a sort BEES RUNS SETS + Dalai Lama supporter MONK + Disintegrating suffix LYZE + Earn a Merit Badge KNOT (could go with Sew up) CAMP + SWIM COOK FISH + Eat HAVE (could go with Wealthy person) DINE + Fictional Boulder resident MORK + Hawaiian port HILO + Incur a phone charge CALL DIAL ROAM + Indian currency BEAD ANNA + Indians' home OHIO + Like Susan? LAZY + Perry's award TONY + Play the hero, perhaps LEAD STAR + Sew up KNOT (could go with Earn a Merit Badge) DARN + KNIT SEAL + Short CURT MINI RUDE TINY FAST + Skinny BONY LEAN SLIM THIN TRIM LANK WIRY + Some nematodes ??? + Take (off) BUZZ KICK LIFT PEEL PULL PUSH RUSH SLIP + Type of therapy COLD GENE HEAT PLAY TALK + Victor, e.g. HUGO NAME VIER + Wealthy person HAVE (could go with EAT) BOSS + With "the", one of the oceans? DEEP MAIN |
+
+ Pairs 1 E S HAVE VASH AHV+ |
+
+
The complete solution to this puzzle is not available.
+
We know that the final answer is supposed to be FOOTBALL PLAY,
+ formed from the three answers FOOT, BALL, and PLAY to the clues
+ formed by the common letters in the pairs. Some possible answers
+ are printed after each clue below. Bold indicates a word used in a
+ possible pairing. Words struck through have no possible pairing.
+
|
+ Clues + Character appearing twice on TNG, once on DS9 VASH + Competitions, of a sort BEES RUNS SETS + Dalai Lama supporter MONK + Disintegrating suffix LYZE + Earn a Merit Badge KNOT (could go with Sew up) CAMP + SWIM COOK FISH + Eat HAVE (could go with Wealthy person) DINE + Fictional Boulder resident MORK + Hawaiian port HILO + Incur a phone charge CALL DIAL ROAM + Indian currency BEAD ANNA + Indians' home OHIO + Like Susan? LAZY + Perry's award TONY + Play the hero, perhaps LEAD STAR + Sew up KNOT (could go with Earn a Merit Badge) DARN + KNIT SEAL + Short CURT MINI RUDE TINY FAST + Skinny BONY LEAN SLIM THIN TRIM LANK WIRY + Some nematodes ??? + Take (off) BUZZ KICK LIFT PEEL PULL PUSH RUSH SLIP + Type of therapy COLD GENE HEAT PLAY TALK + Victor, e.g. HUGO NAME VIER + Wealthy person HAVE (could go with EAT) BOSS + With "the", one of the oceans? DEEP MAIN |
+
+ Pairs 1 E S HAVE VASH AHV+ |
+
+
The original file:
+
"%c%c%c\n", __o_o, o__o_,+
#define _o_o_ if
#define o_o_o else
#define oo___ printf
#include <stdio.h>
*2<(o__o_-__o_o))
+ __o_o; o__o_ = o_o__ +
1; o___o = o__o_ + _o__o - 11;
_o__o * 3; o_o__ = _o__o
_o__o = 24; __o_o =
_o_o_ (((o___o-o__o_))
int _o__o, __o_o;
int main (void)
int o_o__, o__o_, o___o;
o___o); return 0;
o___o, __o_o); o_o_o oo___(
oo___("%c%c%c\n", _o__o,
(
)
This is a C program but it doesn't make any sense because the
+ lines have been sorted. Re-ordering the lines gives:
+
#include <stdio.h>+
#define _o_o_ if
#define o_o_o else
#define oo___ printf
int main (void)
(
int _o__o, __o_o;
int o_o__, o__o_, o___o;
_o__o = 24; __o_o =
_o__o * 3; o_o__ = _o__o
+ __o_o; o__o_ = o_o__ +
1; o___o = o__o_ + _o__o - 11;
_o_o_ (((o___o-o__o_))
*2<(o__o_-__o_o)) +oo___("%c%c%c\n", _o__o,
o___o, __o_o); o_o_o oo___(
"%c%c%c\n", __o_o, o__o_,
o___o); return 0;
)
Compiling and executing this program gives the output Han.
+ HAN is the final answer.
+
Here is a version of the program formatted in a standard way:
+
#include <stdio.h>+
#define _o_o_ if
#define o_o_o else
#define oo___ printf
int main (void)
(
int _o__o, __o_o;
int o_o__, o__o_, o___o;
_o__o = 24;
__o_o = _o__o * 3;
o_o__ = _o__o + __o_o;
o__o_ = o_o__ + 1;
o___o = o__o_ + _o__o - 11;
_o_o_ ( ((o___o-o__o_))*2<(o__o_-__o_o) ) + oo___("%c%c%c\n", _o__o, o___o, __o_o);
o_o_o
oo___("%c%c%c\n", __o_o, o__o_, o___o);
return 0;
)
If, in addition to the #define statements above, you add these:
+
#define _o__o a+
#define __o_o b
#define o_o__ c
#define o__o_ d
#define o___o e
Then the pre-processed program looks like this:
+
int main (void)+
(
int a, b;
int c, d, e;
a = 24;
b = a * 3;
c = a + b;
d = c + 1;
e = d + a - 11;
if ( ((e-d))*2<(d-b) ) + printf("%c%c%c\n", a, e, b);
else
printf("%c%c%c\n", b, d, e);
return 0;
)
In the assignments, a=24, b=72, c = 96, d = 97, e = 110. The
+ comparison is 26<25 so the else block is executed, printing 72,
+ 97, 110 as characters which prints Han.
+
WWWR
+ TOD/RRNDTN
+ ERT
+ RRD
+ ERT
+ TNTT
+ ERT
+ TDNN
+ TTEE
+ TD
From the subtraction TNTT - ERT = TDN, we know T is 1 and N is 0.
+
From the subtraction TDNN - TTEE = TD, we know D is 2. If we
+ assume base 10 (it is remedial mathematics, after all), then we
+ can also get E = 8 from the ones digits.
+
From the subtraction RRN - ERT = RR, we know R is 9.
+
From the last partial product TTEE = R x TOD, knowing TTEE = 1188
+ and R = 9, we can divide to find TOD = 132, so O = 3.
+
As noted in the erratum, W does not work. It should be that W x
+ ERT = TOD, but ERT is 891 and TOD is 132, and this requires W =
+ 6.75.
+
What solvers did: Ignore this problem, and just fill in the
+ letters corresponding to the digits in the given number:
+
23401340
+ DO?NTO?N
+
+
WWWR
+ TOD/RRNDTN
+ ERT
+ RRD
+ ERT
+ TNTT
+ ERT
+ TDNN
+ TTEE
+ TD
From the subtraction TNTT - ERT = TDN, we know T is 1 and N is 0.
+
From the subtraction TDNN - TTEE = TD, we know D is 2. If we
+ assume base 10 (it is remedial mathematics, after all), then we
+ can also get E = 8 from the ones digits.
+
From the subtraction RRN - ERT = RR, we know R is 9.
+
From the last partial product TTEE = R x TOD, knowing TTEE = 1188
+ and R = 9, we can divide to find TOD = 132, so O = 3.
+
As noted in the erratum, W does not work. It should be that W x
+ ERT = TOD, but ERT is 891 and TOD is 132, and this requires W =
+ 6.75.
+
What solvers did: Ignore this problem, and just fill in the
+ letters corresponding to the digits in the given number:
+
23401340
+ DO?NTO?N
+
+
WWWR
+ TOD/RRNDTN
+ ERT
+ RRD
+ ERT
+ TNTT
+ ERT
+ TDNN
+ TTEE
+ TD
From the subtraction TNTT - ERT = TDN, we know T is 1 and N is 0.
+
From the subtraction TDNN - TTEE = TD, we know D is 2. If we
+ assume base 10 (it is remedial mathematics, after all), then we
+ can also get E = 8 from the ones digits.
+
From the subtraction RRN - ERT = RR, we know R is 9.
+
From the last partial product TTEE = R x TOD, knowing TTEE = 1188
+ and R = 9, we can divide to find TOD = 132, so O = 3.
+
As noted in the erratum, W does not work. It should be that W x
+ ERT = TOD, but ERT is 891 and TOD is 132, and this requires W =
+ 6.75.
+
What solvers did: Ignore this problem, and just fill in the
+ letters corresponding to the digits in the given number:
+
23401340
+ DO?NTO?N
+
+
In the grid below, can you locate all of:
+ +Normal word search rules apply: words appear forwards, backwards, up, down, and +diagonally. +Note: Each word in the above list appears by itself, not within a larger word in the +list; + if you are looking for COIN and find it within COINCIDENCE, keep looking. + A word may, however, "bridge" two other words from the list; + if DISCO and INUIT appear together (DISCOINUIT), that COIN counts.
+ + + + +C P T G T F N G W H T Y U T Y W H L G L D Y T P M P+Recently I've discovered something decisively important to the future of +ACME Crime. Now, I know that some of you will express outrage and ask +yourself, who let a thing like this happen? But that's not important +now. What is important is that we ordered too many of those paper cards +that we use to label the cabinets.
+ +Now, I know that you think that this is a bum job for a detective, but +just think a minute. Sooner or later, the city is gonna audit us, and +then if they find that we haven't used all of these labels, it means +fewer requisitions next year, and, you guessed it, pretty soon ACME +Crime completely dissolves and rampant crime ravages this quiet little +town.
+ +I'm counting on you to not let this happen. Figure out how to use the +extra cards. Then give us a call. Your answer is vital to our finances. +
+ +Oh, and rearrange those file cabinets, while you're at it. Some of the +drawers were overcrowded. They don't hold many things, as you +recall.
+ +If you're having trouble, give us a call and we'll help you sort it +out.
+
+
+ +The objects from the drawers are randomly ordered below:
+ +
| Item1 | +Item2 | +Item3 | +Item4 | +Item5 | +Item6 | +
| Item7 | +Item8 | +Item9 | +Item10 | +Item11 | +|
| Item12 | +Item13 | +Item14 | +Item15 | +Item16 | +|
| Item17 | +Item18 | +Item19 | +Item20 | +Item21 | +|
| Item22 | +Item23 | +Item24 | +Item25 | +Item26 | +
Archivist's Note: The content above was found in this folder and doesn't seem to quite correspond to the way the puzzle was presented to the solvers at hunt time, as seen in the following image:
+ +
+
+
+
+
+
+
+
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r409_MIT_Mystery_Hunt_1999_Paris/_solution_assets/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r409_MIT_Mystery_Hunt_1999_Paris/_solution_assets/solution.html
new file mode 100644
index 0000000000000000000000000000000000000000..a031374619b45e53ffe560fda1295718e7b86b8e
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r409_MIT_Mystery_Hunt_1999_Paris/_solution_assets/solution.html
@@ -0,0 +1,60 @@
+
+
+For each bolded word in the poem, count forward a number of words equal to the number of letters in the word. The word you reach is italicized, and is the German translation of the bolded word. So the fourth word after "With" is "mit," the German word for "with." +
++The blank line is six words after bolded "nearly" and four words before italicized "fasten." The German for English "nearly," and the English for German "fasten," is "FAST" which is the answer.
+ +Here is a list of translations, though you only needed to get the idea to fill in the blank, not solve every translation.
+Author's Note 1: This was a fun puzzle to brainstorm for. I was living in Germany at the time, and noticed that many German words looked like English words. I sat down with my German roommates and by the time +dinner was over we had a list 70 long much to our mutual surprise. Thanks to Bridget for helping me find a way to make it into a puzzle that didn't depend too much on being able to find every translation.
+Author's Note 2: Dear solver Arthur: this puzzle was not meant to indicate that you should give up solving. Thanks for sharing your story with us at wrap up.
+ +Solution added in 2010 by the archivists of Beginner's Luck, and updated with additional information from Ken Jacobs. Thanks to Lance Nathan for providing the solution.
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r409_MIT_Mystery_Hunt_1999_Paris/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r409_MIT_Mystery_Hunt_1999_Paris/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..a031374619b45e53ffe560fda1295718e7b86b8e --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r409_MIT_Mystery_Hunt_1999_Paris/solution.html @@ -0,0 +1,60 @@ + + +For each bolded word in the poem, count forward a number of words equal to the number of letters in the word. The word you reach is italicized, and is the German translation of the bolded word. So the fourth word after "With" is "mit," the German word for "with." +
++The blank line is six words after bolded "nearly" and four words before italicized "fasten." The German for English "nearly," and the English for German "fasten," is "FAST" which is the answer.
+ +Here is a list of translations, though you only needed to get the idea to fill in the blank, not solve every translation.
+Author's Note 1: This was a fun puzzle to brainstorm for. I was living in Germany at the time, and noticed that many German words looked like English words. I sat down with my German roommates and by the time +dinner was over we had a list 70 long much to our mutual surprise. Thanks to Bridget for helping me find a way to make it into a puzzle that didn't depend too much on being able to find every translation.
+Author's Note 2: Dear solver Arthur: this puzzle was not meant to indicate that you should give up solving. Thanks for sharing your story with us at wrap up.
+ +Solution added in 2010 by the archivists of Beginner's Luck, and updated with additional information from Ken Jacobs. Thanks to Lance Nathan for providing the solution.
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard5.gif b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard5.gif new file mode 100644 index 0000000000000000000000000000000000000000..fcac2af1cb0398b618f881ce173be9b1566fffbf --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard5.gif @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8885d92c9ddafe5b83d8d092b4e4f75c85b9f47ced3526bb90bab08bc495a39d +size 2944 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/devjoe.css b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/devjoe.css new file mode 100644 index 0000000000000000000000000000000000000000..68a0de63dc7ed3373d31b1b64a659c7a8be28cc2 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/devjoe.css @@ -0,0 +1,163 @@ +@import "css/dejavu-sans.css"; +/* To apply this to a page the way it was intended, add + +in the head element and + +in the body. +*/ +body { +padding: 12pt; +margin: 0pt; +font-family: "DejaVu Sans", sans-serif; +} + +div.tb { +background-image: url("horizdevjoe.gif"); +height: 9px; +position: fixed; +top: 0pt; +left: 0pt; +right: 0pt; +} + +div.bb { +background-image: url("horizdevjoe.gif"); +width: 100%; +height: 9px; +position: fixed; +bottom: 0pt; +left: 0pt; +} + +div.lb { +background-image: url("vertdevjoe.gif"); +width: 9px; +position: fixed; +top: 9px; +bottom: 9px; +left: 0pt; +} + +div.rb { +background-image: url("vertdevjoe.gif"); +width: 9px; +position: fixed; +top: 9px; +bottom: 9px; +right: 0pt; +} + +H1 { +margin-top: 3pt; +margin-bottom: 3pt; +font-size:2em; +} + +H2 { +margin-top: 2pt; +margin-bottom: 2pt; +font-size:1.75em; +} + +H3 { +margin-top: 2pt; +margin-bottom: 2pt; +font-size:1.5em; +} + +H4 { +margin-top: 2pt; +margin-bottom: 2pt; +font-size:1.3em; +} + +H5 { +margin-top: 2pt; +margin-bottom: 2pt; +font-size:1.2em; +} + +H6 { +margin-top: 2pt; +margin-bottom: 2pt; +font-size:1.1em; +} + +P.caption { +margin-top: 2pt; +margin-bottom: 2pt; +text-align: center; +font-weight: bold; +} +/* Make delete buttons in admin interface appear beside what they delete + instead of below it*/ +DIV.puzlink { +margin-top: 0; +padding-top: 0; +float:left; +} +input.linkdel { +float:left; +margin-left:4pt; +border: 1pt solid black; +background: #ff6060; +font-size: 0.63em; +} +BR.clear { +clear: left; +} +P.tight { +margin-top: 0; +margin-bottom: 0; +padding-top: 0; +padding-bottom: 0; +} +P.tighttop { +margin-top: 0; +padding-top: 0; +} +input.spoilerbutton { + display: block; + margin:10px 0 0 0; +} +div.spoiler { + overflow: hidden; +} +div.spoiler > div { + -webkit-transition: all 0.2s ease; + -moz-transition: margin 0.2s ease; + -o-transition: all 0.2s ease; + transition: margin 0.2s ease; +} +input.spoilerbutton[value="Reveal spoiler"] + div.spoiler > div { + margin-top:-1000%; +} +input.spoilerbutton[value="Hide spoiler"] + div.spoiler { + padding:0; + background-color: #dddddd; +} +input.spoilerbutton[value="Show Keywords"] + div.spoiler > div { + margin-top:-1000%; +} +input.spoilerbutton[value="Hide Keywords"] + div.spoiler { + padding:0; +} +input.spoilerbutton[value="Show Answer"] + div.spoiler > div { + margin-top:-1000%; +} +input.spoilerbutton[value="Hide Answer"] + div.spoiler { + padding:0; +} +input.spoilerbutton[value="Show Hints"] + div.spoiler > div { + margin-top:-1000%; +} +input.spoilerbutton[value="Hide Hints"] + div.spoiler { + padding:0; +} +div.puzbox { + float: left; + border: 1px solid black; + margin: 10px; + padding: 10px; + width: 100px; +} diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2004/mit2004r_MIT_Mystery_Hunt_2004_Final_Runaround/timbuktu b/benchmark/MIT_Mystery_Hunt/puzzles/2004/mit2004r_MIT_Mystery_Hunt_2004_Final_Runaround/timbuktu new file mode 100644 index 0000000000000000000000000000000000000000..48e497875a82bc02fa77e508996ce530bb36a3a2 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2004/mit2004r_MIT_Mystery_Hunt_2004_Final_Runaround/timbuktu @@ -0,0 +1,87 @@ + + + + + + |
+ |
+ |
+ |
+ |
+ |
+ |
+
 |
+
+ |
+ |
+ |
+ |
+ |
+ |
+
 |
+ |
+ |
+ |
+ |
+ |
+ |
+
 |
+ |
+ |
+ |
+
+ |
+ |
+ |
+
|
+ + | |
+
Abigail Freebie + Moira Bruiser + Samantha Oriflamme |
+ + | Elihu Leather + Bobby Morrow + Hal Cleveland |
+
| + | + | + |
page 1 front |
+ + | page 1 back |
+