diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998mm_MIT_Mystery_Hunt_1998_Final_Runaround/4.4444_Structures.html b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998mm_MIT_Mystery_Hunt_1998_Final_Runaround/4.4444_Structures.html new file mode 100644 index 0000000000000000000000000000000000000000..6467d0a4357b2921c42ec1edbaf97682553cbcb2 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998mm_MIT_Mystery_Hunt_1998_Final_Runaround/4.4444_Structures.html @@ -0,0 +1,42 @@ + + + + + + 4.4444 Structures + + +

4.4444 Structures

+

Prof. T. Weisswange (See solution)
+

+

Herb's playing a game of Tetris. He's just not very good at it. + He only manages to score 9 rows throughout the whole game. Also, + he doesn't know that he can rotate the pieces. The pit or the game + is 10 squares wide by 15 squares high. The pieces Herb got are + shown below. Remember to remove any complete rows.
+

+

Your job is to reconstruct the full Tetris game, from beginning + to end. The last piece will go over the top of the pit. Herb will + succeed in dropping 9 rows. Do not rotate any pieces as they fall. + The blocks remaining at the end of the game will spell out your + answer.
+

+

There were multiple errata:
+

+ +

Here are the pieces for the entire game, in order:
+

+
1. AR   2. BR   3. W    4. TS   5. EC   6. H    7.  E   8. KL
TH LO CH T. IS IT R IM
E L ON

9. RE 10. B 11. B 12. E 13. A 14. ME 15. F
IC AYE U CTL MA SO Y
S Y D
I N

16. L 17. LOC 18. T 19. E 20. Y 21. S 22. RL
TON L KP ART BE WA IS
N R H

23. AN 24. WE 25. HI 26. E 27. THEN 28. R 29. IN
IN LL OU M, LD FI
R N

30. UI 31. L 32. ! 33. O 34. TI 35. EM 36. FI
TH G D , OL SC OL
ND E UP
B

37. L 38. R 39. T 40. -C 41. E 42. AL 43. RED
TH ND URY SC EN T D
N I O L

44. UA 45. ON 46. G 47. FF 48. L 49. ?
MI SQ THE MI TOP PIN

50. HE' 51. WH 52. ERES 53. X
O DO WA
S
+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998mm_MIT_Mystery_Hunt_1998_Final_Runaround/Junior_Final_Exam.html b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998mm_MIT_Mystery_Hunt_1998_Final_Runaround/Junior_Final_Exam.html new file mode 100644 index 0000000000000000000000000000000000000000..e136ebf6ed85d910274c0f3e19b19a2de036d843 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998mm_MIT_Mystery_Hunt_1998_Final_Runaround/Junior_Final_Exam.html @@ -0,0 +1,71 @@ + + + + + + Junior Final Exam + + +

Department of Enigmatology

+

Junior Year Requirements

+

(See solution)
+

+

Select one class from each of the following 15 groupings:
+

+

A) 4.666, + 19.012
+

+

B) 19.13, + 19.678
+

+

C) 7.270, 19.456
+

+

D) 19.345, 6.551J
+

+

E) 18.000, 19.234
+

+

F) 19.00s
+

+

G) 19.789
+

+

H) 24.917, + 18.123
+

+

I) 5.198, + L.???
+

+

J) 19.567
+

+

K) 19.001, + 18.101
+

+

L) 24.845
+

+

M) 19.2837
+

+

N) 19.503
+

+

O) 6.1835
+

+ Note: There is no sign of puzzle + 19.345 in the archive materials. It may be lost, or may not have + ever been delivered to teams.
+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r1p11_MIT_Mystery_Hunt_1998_Extracurricular_Activity_Skeet_Shooting_Club/Extracurricular_Activity_--_Skeet_Shooting_Club_Solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r1p11_MIT_Mystery_Hunt_1998_Extracurricular_Activity_Skeet_Shooting_Club/Extracurricular_Activity_--_Skeet_Shooting_Club_Solution.html new file mode 100644 index 0000000000000000000000000000000000000000..77da8d64d7973489c1a0d8c4b0e27f477c7c0134 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r1p11_MIT_Mystery_Hunt_1998_Extracurricular_Activity_Skeet_Shooting_Club/Extracurricular_Activity_--_Skeet_Shooting_Club_Solution.html @@ -0,0 +1,65 @@ + + + + + Extracurricular Activity -- Skeet Shooting Club Solution + + +

Extracurricular Activity -- Skeet Shooting Club Solution
+

+

When you attempt to solve this puzzle, you quickly discover that + the words don't match the clues. None of them are an anagram of a + planet, and "pluralized by adding three letters" suggests "child" + but what's there instead is CHILL. You have to change one letter + in each word to make them work. That's the "other thing" you were + supposed to figure out.
+

+

Which word:
+ anagrams to the name of a planet? HEARD -> HEART + (EARTH)
+ appears elsewhere in these questions? PLANES -> PLANET
+ becomes a new word when you remove both T's? LESTER -> + LETTER (LEER)
+ becomes its own synonym if you drop its first and fifth letters? EVALUATE + -> EVACUATE (VACATE)
+ becomes the name of a fish if you swap the letters on its ends? PUNT + -> AUNT (TUNA)
+ changes gender by having SS added to the end? PRANCE -> + PRINCE (PRINCESS)
+ contains three pairs of double letters? COMMITTED -> + COMMITTEE
+ forms new words upon removing its first, second, or both first and + second letters? SLAKE -> SLATE (LATE, SATE, ATE)
+ has been a name in the news of late? MUDDY -> BUDDY (Errata: the "name in the news" is not + the name of a human being)
+ has the same cryptographic pattern as FLOODED? COLLAGE + -> COLLEGE
+ is a first name of a famous director with the same cryptographic + pattern as the director's last name? WORDY -> WOODY + (ALLEN)
+ is also the name of a fictional rat? SPLITTER -> + SPLINTER
+ is a name sounding like a famous film monster? ROBIN -> + RODIN (RODAN)
+ is Pig Latin for a name meaning "king"? PRAY -> XRAY + (REX)
+ is pluralized by adding three letters? CHILL -> CHILD + (CHILDREN)
+ is the name of a cable channel? BRAVE -> BRAVO
+ is transformed to a new word when its first letter is changed to a + D and moved to the end? SALOON -> SALMON (ALMOND)
+ sounds like a word meaning "gospel" when pronounced with a lisp? TRACE + -> TRUCE (TRUTH)
+ spells a word meaning "jelly" if its last letter is moved to the + front? PLATING -> ELATING (GELATIN)
+ uses all the letters that appear in the last seven words of a + popular Christmas song? DEPORTING -> DEPARTING (AND A + PARTRIDGE IN A PEAR TREE)
+

+

The changed letters aren't used. But the leftover words are + CONCERT DO MOUSE RODE. Keeping them in this order but changing a + letter in each one gives the final answer, CONVERT TO MORSE CODE.
+

+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r3m_MIT_Mystery_Hunt_1998_Junior_Year_Requirements/Junior_Final_Exam.html b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r3m_MIT_Mystery_Hunt_1998_Junior_Year_Requirements/Junior_Final_Exam.html new file mode 100644 index 0000000000000000000000000000000000000000..d4f5711190825ce9344b61add3a1db383ee72d8a --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r3m_MIT_Mystery_Hunt_1998_Junior_Year_Requirements/Junior_Final_Exam.html @@ -0,0 +1,71 @@ + + + + + + Junior Final Exam + + +

Department of Enigmatology

+

Junior Year Requirements

+

(See solution)
+

+

Select one class from each of the following 15 groupings:
+

+

A) 4.666, + 19.012
+

+

B) 19.13, + 19.678
+

+

C) 7.270, 19.456
+

+

D) 19.345, 6.551J
+

+

E) 18.000, 19.234
+

+

F) 19.00s
+

+

G) 19.789
+

+

H) 24.917, + 18.123
+

+

I) 5.198, + L.???
+

+

J) 19.567
+

+

K) 19.001, + 18.101
+

+

L) 24.845
+

+

M) 19.2837
+

+

N) 19.503
+

+

O) 6.1835
+

+ Note: There is no sign of puzzle + 19.345 in the archive materials. It may be lost, or may not have + ever been delivered to teams.
+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r4m_MIT_Mystery_Hunt_1998_Senior_Metapuzzle/4.4444_Structures.html b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r4m_MIT_Mystery_Hunt_1998_Senior_Metapuzzle/4.4444_Structures.html new file mode 100644 index 0000000000000000000000000000000000000000..6467d0a4357b2921c42ec1edbaf97682553cbcb2 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r4m_MIT_Mystery_Hunt_1998_Senior_Metapuzzle/4.4444_Structures.html @@ -0,0 +1,42 @@ + + + + + + 4.4444 Structures + + +

4.4444 Structures

+

Prof. T. Weisswange (See solution)
+

+

Herb's playing a game of Tetris. He's just not very good at it. + He only manages to score 9 rows throughout the whole game. Also, + he doesn't know that he can rotate the pieces. The pit or the game + is 10 squares wide by 15 squares high. The pieces Herb got are + shown below. Remember to remove any complete rows.
+

+

Your job is to reconstruct the full Tetris game, from beginning + to end. The last piece will go over the top of the pit. Herb will + succeed in dropping 9 rows. Do not rotate any pieces as they fall. + The blocks remaining at the end of the game will spell out your + answer.
+

+

There were multiple errata:
+

+ +

Here are the pieces for the entire game, in order:
+

+
1. AR   2. BR   3. W    4. TS   5. EC   6. H    7.  E   8. KL
TH LO CH T. IS IT R IM
E L ON

9. RE 10. B 11. B 12. E 13. A 14. ME 15. F
IC AYE U CTL MA SO Y
S Y D
I N

16. L 17. LOC 18. T 19. E 20. Y 21. S 22. RL
TON L KP ART BE WA IS
N R H

23. AN 24. WE 25. HI 26. E 27. THEN 28. R 29. IN
IN LL OU M, LD FI
R N

30. UI 31. L 32. ! 33. O 34. TI 35. EM 36. FI
TH G D , OL SC OL
ND E UP
B

37. L 38. R 39. T 40. -C 41. E 42. AL 43. RED
TH ND URY SC EN T D
N I O L

44. UA 45. ON 46. G 47. FF 48. L 49. ?
MI SQ THE MI TOP PIN

50. HE' 51. WH 52. ERES 53. X
O DO WA
S
+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r4p06_MIT_Mystery_Hunt_1998_4.4444_Structures/4.4444_Structures.html b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r4p06_MIT_Mystery_Hunt_1998_4.4444_Structures/4.4444_Structures.html new file mode 100644 index 0000000000000000000000000000000000000000..c73d287f8686c197709c5764a9a7c23aa2250391 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1998/mit1998r4p06_MIT_Mystery_Hunt_1998_4.4444_Structures/4.4444_Structures.html @@ -0,0 +1,42 @@ + + + + + + 4.4444 Structures + + +

4.4444 Structures

+

Prof. T. Weisswange (See solution)
+

+

Herb's playing a game of Tetris. He's just not very good at it. + He only manages to score 9 rows throughout the whole game. Also, + he doesn't know that he can rotate the pieces. The pit or the game + is 10 squares wide by 15 squares high. The pieces Herb got are + shown below. Remember to remove any complete rows.
+

+

Your job is to reconstruct the full Tetris game, from beginning + to end. The last piece will go over the top of the pit. Herb will + succeed in dropping 9 rows. Do not rotate any pieces as they fall. + The blocks remaining at the end of the game will spell out your + answer.
+

+

There were multiple errata:
+

+ +

Here are the pieces for the entire game, in order:
+

+
1. AR   2. BR   3. W    4. TS   5. EC   6. H    7.  E   8. KL
TH LO CH T. IS IT R IM
E L ON

9. RE 10. B 11. B 12. E 13. A 14. ME 15. F
IC AYE U CTL MA SO Y
S Y D
I N

16. L 17. LOC 18. T 19. E 20. Y 21. S 22. RL
TON L KP ART BE WA IS
N R H

23. AN 24. WE 25. HI 26. E 27. THEN 28. R 29. IN
IN LL OU M, LD FI
R N

30. UI 31. L 32. ! 33. O 34. TI 35. EM 36. FI
TH G D , OL SC OL
ND E UP
B

37. L 38. R 39. T 40. -C 41. E 42. AL 43. RED
TH ND URY SC EN T D
N I O L

44. UA 45. ON 46. G 47. FF 48. L 49. ?
MI SQ THE MI TOP PIN

50. HE' 51. WH 52. ERES 53. X
O DO WA
S
+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999dossiers_MIT_Mystery_Hunt_1999_Dossiers_Meta/new_york_city.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999dossiers_MIT_Mystery_Hunt_1999_Dossiers_Meta/new_york_city.html new file mode 100644 index 0000000000000000000000000000000000000000..0d79f6b25be60b9eac8f2441a66df2a428daabbe --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999dossiers_MIT_Mystery_Hunt_1999_Dossiers_Meta/new_york_city.html @@ -0,0 +1,89 @@ + + +New York City + + + +

New York City

+

+This puzzle is a scavenger hunt to test your skills at gathering +evidence. Please bring us items that can be described by these +adjectives: +

+
+ + + + +
+adjustable
alliterative
alphabetical +
antique
banned
bifurcated
black-and-white +
bleached
broken
certified
chocolate* +
classified
complete
concave
convex +
cordless
crustaceous
crystalline +
+custom-made
distilled +
electronic
expired
extinct
flammable +
flat
folding
free
hollow
home-cooked*
igneous +
inflammable
inflatable
infrared
inside-out +
knotted
lenticular +
+mechanical
microwave
molded +
mucilaginous
obsolete
octagonal +
onomatopoetic
ovoid
patented
perforated +
phosphorescent
plaid
platonic
polka-dotted +
postmarked
prefabricated
radioactive +
red-white-and-blue +
+reversed
romantic
sealed
short +
silk-screened
slimy
smooth
spherical +
sterile
striped
symmetrical
tall +
thixotropic
three-dimensional
toroidal +
transparent
ultraviolet
upside-down +
+

Here are the rules:

+
    +
  1. For each object, you will receive 7 points if the object can be +described by one adjective, 20 points if it can be described by two +adjectives, 35 for three, 196 for ten, etc., i.e., (10N+N^2-4) for N.
  2. + +
  3. You must bring us objects totalling 750 points. If you can find a +single +object that can be described by 27 of the adjectives (and therefore worth +752 points), you only need to bring us that one object.
  4. + +
  5. You will get 10 extra points for the +adjectives marked with *s; any such items will be kept +by the judges.
  6. + +
  7. The standard for each adjective/object is whether or not +the answer to the question "Is that <object> <adjective>?" +would be yes. E.g., if one of the adjectives was "purple" +and you brought us a Barney doll, the question would be "Is +that doll purple?". Interpretation of the question is in the +opinion of the judges although you are welcome to offer +suggestions.
  8. + +
  9. The teams bringing us (1) the highest point object and +(2) the fewest objects totalling 750 points will each +receive a bonus. If this is the same team, they will get two +bonuses.
  10. + +
+

Some restrictions:

+
    +
  1. You may only count each adjective once.
  2. + +
  3. You must bring us actual objects. We will not accept the following: +photographs, drawings or written depictions of objects. Objects must be +portable -- you must actually bring them to us.
  4. + +
  5. We will not accept: anything created, fabricated or modified for this +scavenger hunt, anything illegal, living animals or anything containing +living animals (including humans).
  6. +
+ +

Solution

+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r107_MIT_Mystery_Hunt_1999_New_York_City/new_york_city.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r107_MIT_Mystery_Hunt_1999_New_York_City/new_york_city.html new file mode 100644 index 0000000000000000000000000000000000000000..39b67d488eac3e4a150fce3cfa237e4d921b076e --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r107_MIT_Mystery_Hunt_1999_New_York_City/new_york_city.html @@ -0,0 +1,89 @@ + + +New York City + + + +

New York City

+

+This puzzle is a scavenger hunt to test your skills at gathering +evidence. Please bring us items that can be described by these +adjectives: +

+
+ + + + +
+adjustable
alliterative
alphabetical +
antique
banned
bifurcated
black-and-white +
bleached
broken
certified
chocolate* +
classified
complete
concave
convex +
cordless
crustaceous
crystalline +
+custom-made
distilled +
electronic
expired
extinct
flammable +
flat
folding
free
hollow
home-cooked*
igneous +
inflammable
inflatable
infrared
inside-out +
knotted
lenticular +
+mechanical
microwave
molded +
mucilaginous
obsolete
octagonal +
onomatopoetic
ovoid
patented
perforated +
phosphorescent
plaid
platonic
polka-dotted +
postmarked
prefabricated
radioactive +
red-white-and-blue +
+reversed
romantic
sealed
short +
silk-screened
slimy
smooth
spherical +
sterile
striped
symmetrical
tall +
thixotropic
three-dimensional
toroidal +
transparent
ultraviolet
upside-down +
+

Here are the rules:

+
    +
  1. For each object, you will receive 7 points if the object can be +described by one adjective, 20 points if it can be described by two +adjectives, 35 for three, 196 for ten, etc., i.e., (10N+N^2-4) for N.
  2. + +
  3. You must bring us objects totalling 750 points. If you can find a +single +object that can be described by 27 of the adjectives (and therefore worth +752 points), you only need to bring us that one object.
  4. + +
  5. You will get 10 extra points for the +adjectives marked with *s; any such items will be kept +by the judges.
  6. + +
  7. The standard for each adjective/object is whether or not +the answer to the question "Is that <object> <adjective>?" +would be yes. E.g., if one of the adjectives was "purple" +and you brought us a Barney doll, the question would be "Is +that doll purple?". Interpretation of the question is in the +opinion of the judges although you are welcome to offer +suggestions.
  8. + +
  9. The teams bringing us (1) the highest point object and +(2) the fewest objects totalling 750 points will each +receive a bonus. If this is the same team, they will get two +bonuses.
  10. + +
+

Some restrictions:

+
    +
  1. You may only count each adjective once.
  2. + +
  3. You must bring us actual objects. We will not accept the following: +photographs, drawings or written depictions of objects. Objects must be +portable -- you must actually bring them to us.
  4. + +
  5. We will not accept: anything created, fabricated or modified for this +scavenger hunt, anything illegal, living animals or anything containing +living animals (including humans).
  6. +
+ +

Solution

+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r304_MIT_Mystery_Hunt_1999_Capetown/_solution_assets/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r304_MIT_Mystery_Hunt_1999_Capetown/_solution_assets/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..9953afae94dbfc56d22d192d7aa5d24a389696bd --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r304_MIT_Mystery_Hunt_1999_Capetown/_solution_assets/solution.html @@ -0,0 +1,61 @@ +Capetown: Solution +

Capetown:Solution

+ +

+Milton is using the right-hand-wall method. 3 of his steps make one wall +segment. ^ and v symbols in his transcription indicate turns, and | indicates +where a wall ends and he makes two turns in a row. When he makes a right turn, +Milton takes an extra step, indicated by a 1 above the arrow for it. When he +goes around the end of a wall, this takes 2 steps, also as indicated. When he +is forced to make a left turn, he takes one less step in the next segment +because, due to the size of his body, he started one step into the first +segment. Using his moves, you can reconstruct much of the maze: +
+ +

+With this done, you can make more sense of Jottie's notes, assuming the +same starting point. Jottie does not finish the maze, stopping to write down +the story at the piece of paper (marked "P" below):
+ +

+With the doorways we already know, the only place where the long corridor +seen in Blinky's third photo, dead-ending with at least 3 squares of walls +on both sides in a corridor that appears 6 spaces long, is at the far left. +This tells us some more light and dark over there. +

+Also, the only place that has the collection of three doorways, none at a +corner, seen in photo 2 is in the section of corridor where Jottie finished. +With the faint bits of light seen at the edges of the far doorways, we know +all five of the spaces in the dead ends beyond those doorways are lit. +

+Now the fourth photo cannot be this same hallway because there is no doorway +on the right in the photo. It cannot be the hallway to the left of this in +the maze since that hallway does not have the opening to the left at the end. +None of the hallways further left have the two doorways together seen here. +The hallway to the right of the one Jottie finished in does not have room for +these doorways either. Only the right-most hallway matched what can be seen +here, so we know three squares of light and a bunch more darkness. +

+The hallway in the last photo cannot be any of the four totally dark ones +Jottie traveled, since it had light, and it does not match either end hallway, +so it is the hallway just right of Jottie's finishing point. This confirms +two more squares of light and some more darkness. +

+Now we know the entire maze pattern, and there are only three places with the +side-by-side doorways seen in the first photo. Two of them we know do not have +the one square of darkness seen through the far doorway, so this must be the +left-most of the three pairs of doorways. Jottie neglected to tell us about +the lighting conditions in the lower of these two doorways, but now we know.
+ +

+We still don't know the light state of a few spaces at the lower right, but +we know enough. The walls of the maze form letters spelling CHEESE. But that +is not the answer; it's too obvious, and even Jottie knew there would be +cheese in the maze. The darkened areas also form letter shapes spelling JAM, +and that is the answer.
+ + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r304_MIT_Mystery_Hunt_1999_Capetown/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r304_MIT_Mystery_Hunt_1999_Capetown/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..9953afae94dbfc56d22d192d7aa5d24a389696bd --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r304_MIT_Mystery_Hunt_1999_Capetown/solution.html @@ -0,0 +1,61 @@ +Capetown: Solution +

Capetown:Solution

+ +

+Milton is using the right-hand-wall method. 3 of his steps make one wall +segment. ^ and v symbols in his transcription indicate turns, and | indicates +where a wall ends and he makes two turns in a row. When he makes a right turn, +Milton takes an extra step, indicated by a 1 above the arrow for it. When he +goes around the end of a wall, this takes 2 steps, also as indicated. When he +is forced to make a left turn, he takes one less step in the next segment +because, due to the size of his body, he started one step into the first +segment. Using his moves, you can reconstruct much of the maze: +
+ +

+With this done, you can make more sense of Jottie's notes, assuming the +same starting point. Jottie does not finish the maze, stopping to write down +the story at the piece of paper (marked "P" below):
+ +

+With the doorways we already know, the only place where the long corridor +seen in Blinky's third photo, dead-ending with at least 3 squares of walls +on both sides in a corridor that appears 6 spaces long, is at the far left. +This tells us some more light and dark over there. +

+Also, the only place that has the collection of three doorways, none at a +corner, seen in photo 2 is in the section of corridor where Jottie finished. +With the faint bits of light seen at the edges of the far doorways, we know +all five of the spaces in the dead ends beyond those doorways are lit. +

+Now the fourth photo cannot be this same hallway because there is no doorway +on the right in the photo. It cannot be the hallway to the left of this in +the maze since that hallway does not have the opening to the left at the end. +None of the hallways further left have the two doorways together seen here. +The hallway to the right of the one Jottie finished in does not have room for +these doorways either. Only the right-most hallway matched what can be seen +here, so we know three squares of light and a bunch more darkness. +

+The hallway in the last photo cannot be any of the four totally dark ones +Jottie traveled, since it had light, and it does not match either end hallway, +so it is the hallway just right of Jottie's finishing point. This confirms +two more squares of light and some more darkness. +

+Now we know the entire maze pattern, and there are only three places with the +side-by-side doorways seen in the first photo. Two of them we know do not have +the one square of darkness seen through the far doorway, so this must be the +left-most of the three pairs of doorways. Jottie neglected to tell us about +the lighting conditions in the lower of these two doorways, but now we know.
+ +

+We still don't know the light state of a few spaces at the lower right, but +we know enough. The walls of the maze form letters spelling CHEESE. But that +is not the answer; it's too obvious, and even Jottie knew there would be +cheese in the maze. The darkened areas also form letter shapes spelling JAM, +and that is the answer.
+ + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r402_MIT_Mystery_Hunt_1999_Cambridge/_solution_assets/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r402_MIT_Mystery_Hunt_1999_Cambridge/_solution_assets/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..2af54af02e3ce6e3556969a76f65dce31d168842 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r402_MIT_Mystery_Hunt_1999_Cambridge/_solution_assets/solution.html @@ -0,0 +1,78 @@ + + +Cambridge: Solution + + +

Cambridge: Solution

+ +

This puzzle is the final meta for this Hunt, and required the Warrant answers as input. It has two parts. The first part is a really simple cryptogram which gives the algorithm used to encode the secret message. The second part is the encoded message.

+ +

Here's the answer to the simple cryptogram:

+
+
+Example:
+If the secret message were "Message to y'all", and the warrant
+answers, in order, were "this", "is", "our", and "test", then
+line up the words like this:
+
+MESSAGETOYALL   (cap everything, remove spaces and punctuation)
+THISISOURTEST   (The warrant answers, capped, in order)
+TESTTHISIOURO   (Below every warrant answer, the previous one,
+                 duplicated and truncated as necessary)
+
+Add them up:
+ZQTECGBGOGZVT  (That's the encrypted text)
+
+
+ + + +

The order of the warrant answers is the order of their crooks as defined in the special bulletin and a later +message from Carmen to Tracy. The warrant answers, in order, are:

+ +

VALERIE STEREO JABIR MUSE ANIME SEVENTY RAINBOW INTERACT GENERIC DONUTS BOKCHOY RHYTHM

+ +

The encoded message is:

+ +

ABC order the city answers. Using this order on the cities, read fifth letter to find the loot.

+ +

Indeed if you follow the instructions (except for counting spaces as letters, spelling out all acronyms except for ROTC, misordering FUNK and FREQUENCY, and spelling "millennium" incorrectly in the solution) you get:

+ +

PENULTIMATE MYSTERY HUNT COIN OF THIS MILLENIUM.

+ +

If you call in this solution to Acme, you are told you come to their headquarters to get a warrant for +Carmen. This final puzzle is a riddle trail leading to the coin.

+ + +
+ +
+

Composer's notes

+
    +
  1. +

    The original idea for the warrant ordering was to have the hunters take the mysterious zsigs and make +a big list (by putting zsig A after zsig B if zsig B started with the word ending zsig A).

    + +

    They were then to find out how the loots would fit in this list (*** need example ***). This would then +order the loots, and hence the warrant answers. Unfortunately, the order given to me was incorrect. We +decided to simply give the hunters the order. Which was just as well, considering how long the hunt +went on.

    +
  2. +
  3. The originally proposed encryption scheme was to have the key be the warrant answers in order +(instead of the more complicated one presented). It was observed that it would be very easy to determine +the correct position of a warrant answer by passing it over the encrypted text and finding where the +deciphered plaintext made sense. The implemented scheme forces you to know the order.

    +
  4. +
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r402_MIT_Mystery_Hunt_1999_Cambridge/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r402_MIT_Mystery_Hunt_1999_Cambridge/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..2af54af02e3ce6e3556969a76f65dce31d168842 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/1999/mit1999r402_MIT_Mystery_Hunt_1999_Cambridge/solution.html @@ -0,0 +1,78 @@ + + +Cambridge: Solution + + +

Cambridge: Solution

+ +

This puzzle is the final meta for this Hunt, and required the Warrant answers as input. It has two parts. The first part is a really simple cryptogram which gives the algorithm used to encode the secret message. The second part is the encoded message.

+ +

Here's the answer to the simple cryptogram:

+
+
+Example:
+If the secret message were "Message to y'all", and the warrant
+answers, in order, were "this", "is", "our", and "test", then
+line up the words like this:
+
+MESSAGETOYALL   (cap everything, remove spaces and punctuation)
+THISISOURTEST   (The warrant answers, capped, in order)
+TESTTHISIOURO   (Below every warrant answer, the previous one,
+                 duplicated and truncated as necessary)
+
+Add them up:
+ZQTECGBGOGZVT  (That's the encrypted text)
+
+
+ + + +

The order of the warrant answers is the order of their crooks as defined in the special bulletin and a later +message from Carmen to Tracy. The warrant answers, in order, are:

+ +

VALERIE STEREO JABIR MUSE ANIME SEVENTY RAINBOW INTERACT GENERIC DONUTS BOKCHOY RHYTHM

+ +

The encoded message is:

+ +

ABC order the city answers. Using this order on the cities, read fifth letter to find the loot.

+ +

Indeed if you follow the instructions (except for counting spaces as letters, spelling out all acronyms except for ROTC, misordering FUNK and FREQUENCY, and spelling "millennium" incorrectly in the solution) you get:

+ +

PENULTIMATE MYSTERY HUNT COIN OF THIS MILLENIUM.

+ +

If you call in this solution to Acme, you are told you come to their headquarters to get a warrant for +Carmen. This final puzzle is a riddle trail leading to the coin.

+ + +
+ +
+

Composer's notes

+
    +
  1. +

    The original idea for the warrant ordering was to have the hunters take the mysterious zsigs and make +a big list (by putting zsig A after zsig B if zsig B started with the word ending zsig A).

    + +

    They were then to find out how the loots would fit in this list (*** need example ***). This would then +order the loots, and hence the warrant answers. Unfortunately, the order given to me was incorrect. We +decided to simply give the hunters the order. Which was just as well, considering how long the hunt +went on.

    +
  2. +
  3. The originally proposed encryption scheme was to have the key be the warrant answers in order +(instead of the more complicated one presented). It was observed that it would be very easy to determine +the correct position of a warrant answer by passing it over the encrypted text and finding where the +deciphered plaintext made sense. The implemented scheme forces you to know the order.

    +
  4. +
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard1.gif b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard1.gif new file mode 100644 index 0000000000000000000000000000000000000000..ed1ffb1d927402538a06ecf436f1e4e02b6bce86 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard1.gif @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fd8234dbd1d05c7017b96d3b9980fdc628421f50ae48c357914798424efa59b2 +size 3203 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard2.gif b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard2.gif new file mode 100644 index 0000000000000000000000000000000000000000..e8e577bf3b5a615733ae96534b8a35cd9aa8c9e3 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard2.gif @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2529b965e7cea55906a954fb785d61b715371b7702ace9c100680eeab5960df3 +size 3148 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard2a.gif b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard2a.gif new file mode 100644 index 0000000000000000000000000000000000000000..416650a6b48395e15f07ecbb663e91c0f4f192d2 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard2a.gif @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:969ce783176d70a11e830c90069c75294d1594cfe217dc2273047a0dd3932f09 +size 3140 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard3.gif b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard3.gif new file mode 100644 index 0000000000000000000000000000000000000000..879c076290a7e5b7055c29bc26aea4d391299ca8 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2002/mit200224_MIT_Mystery_Hunt_2002_D2_The_Mighty_Duck_Konundrum/chessboard3.gif @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a353985db977b5433a8fdd4b17eea773ca19b21299e544d7c4b2501573d672bf +size 3078 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2004/mit2004r_MIT_Mystery_Hunt_2004_Final_Runaround/aztec b/benchmark/MIT_Mystery_Hunt/puzzles/2004/mit2004r_MIT_Mystery_Hunt_2004_Final_Runaround/aztec new file mode 100644 index 0000000000000000000000000000000000000000..144d884d25999c965ca00abad6488398ebd9cb2e --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2004/mit2004r_MIT_Mystery_Hunt_2004_Final_Runaround/aztec @@ -0,0 +1,98 @@ + + + + + + Tenochtitlan + + + + + +
+
+ Tenochtitlan
+ (back to the map) +
+
+ +
+
+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

+ +
+
+ +
+ + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2011/mit2011w2blackberryman5_MIT_Mystery_Hunt_2011_The_Least_You_Could_Do_Is_Phone_Me/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2011/mit2011w2blackberryman5_MIT_Mystery_Hunt_2011_The_Least_You_Could_Do_Is_Phone_Me/index.html new file mode 100644 index 0000000000000000000000000000000000000000..2b1bdd521e9a74808ec87908cf0d830316f85952 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2011/mit2011w2blackberryman5_MIT_Mystery_Hunt_2011_The_Least_You_Could_Do_Is_Phone_Me/index.html @@ -0,0 +1,68 @@ + + + +The Least You Could Do Is Phone Me + + + + + + + + +
+
+
+ +
+
+
+ +
+
+
The Least You Could Do Is Phone Me
+ +
+
+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2011/mit2011w2blackberryman5_MIT_Mystery_Hunt_2011_The_Least_You_Could_Do_Is_Phone_Me/the_least_you_could_do_is_phone_me b/benchmark/MIT_Mystery_Hunt/puzzles/2011/mit2011w2blackberryman5_MIT_Mystery_Hunt_2011_The_Least_You_Could_Do_Is_Phone_Me/the_least_you_could_do_is_phone_me new file mode 100644 index 0000000000000000000000000000000000000000..fa8cece1cccc892a6cad9224b67ddcba77741e3b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2011/mit2011w2blackberryman5_MIT_Mystery_Hunt_2011_The_Least_You_Could_Do_Is_Phone_Me/the_least_you_could_do_is_phone_me @@ -0,0 +1,68 @@ + + + +The Least You Could Do Is Phone Me + + + + + + + + +
+
+
+ +
+
+
+ +
+
+
The Least You Could Do Is Phone Me
+ +
+
+ + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW14.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW14.jpg new file mode 100644 index 0000000000000000000000000000000000000000..02aed0021cdb361c0002b5695deea422cd163d2d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW14.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:df2fea41d5fba836bb43d67202b135804eebb41bda02e4fa3879ef445dacbfc0 +size 3115 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW23.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW23.jpg new file mode 100644 index 0000000000000000000000000000000000000000..6a86c81dfe9051a86323c3bba83e2a6c6ba1d3fb --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW23.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5cb9268e4baf21b7b9dea593558d26c5788592520e45d91a1c47812c63176ac0 +size 3096 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW25.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW25.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c890e755f284b9bd941c31066d5c543619171996 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW25.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e07592c1f47d1b5164984a2ddef3b965aab1b3d29454e54a1b7806fcb8d4e430 +size 3114 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW26.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW26.jpg new file mode 100644 index 0000000000000000000000000000000000000000..2e58dc242c917dee64d510c5fb040682fec4d28e --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW26.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1eabc5bd1811bb45de003265e3242e0269045885668daa6b2eb311f26dc5e8fb +size 3073 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW27.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW27.jpg new file mode 100644 index 0000000000000000000000000000000000000000..2b758c8e131325a93864b44a868a2b6378961688 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013231_MIT_Mystery_Hunt_2013_Cambridge_Waldo/CW27.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bff4cd8b22479ff365fb98d0e7c2116f6fd758e152b98136b2419db532014f7a +size 3079 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013245_MIT_Mystery_Hunt_2013_Slinking_Slumber/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013245_MIT_Mystery_Hunt_2013_Slinking_Slumber/index.html new file mode 100644 index 0000000000000000000000000000000000000000..8038a97830a0f9cbb2d8de28e57dcadcbea8b59d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013245_MIT_Mystery_Hunt_2013_Slinking_Slumber/index.html @@ -0,0 +1,106 @@ + + + +Richard Feynman -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

Slinking Slumber: Q.E.D.

+ +

There once were two snakes from South Wales
+Who dreamed they were eating their tails.
+They woke up quite distraught,
+Stomachs tied up in knots,
+And indeed, with their mouths full of scales!

java -jar Snake.jar

If you would like to see the source code, you may download it here: Snake.scala

+ + +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/4-1.png b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/4-1.png new file mode 100644 index 0000000000000000000000000000000000000000..dc53ca9c82c806b55392096e0aa964b6d2685a84 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/4-1.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8b95f2033c654e4bab933151f3a6ffc2c2c7a0198272a4e45cc31f0ba287d859 +size 3198 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/6-1.png b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/6-1.png new file mode 100644 index 0000000000000000000000000000000000000000..525afda4ba8e05a627826f9a732354f4a767e271 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/6-1.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:62fa1f3962fb6bdfc225d1a04e395799aca184734eb5235be722a0abe1fc3b24 +size 3166 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/index.html new file mode 100644 index 0000000000000000000000000000000000000000..41231ea3ed5bf7573e6fd8fc20d540dd81a64baf --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013283_MIT_Mystery_Hunt_2013_Lost_in_Translation/index.html @@ -0,0 +1,102 @@ + + + +Richard Feynman -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

Lost in Translation: Q.E.D.

+ +





+ + +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013293_MIT_Mystery_Hunt_2013_lol/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013293_MIT_Mystery_Hunt_2013_lol/index.html new file mode 100644 index 0000000000000000000000000000000000000000..a64573c34dd2899e27a2f230ed18e6b73ca014ce --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013293_MIT_Mystery_Hunt_2013_lol/index.html @@ -0,0 +1,102 @@ + + + +Richard Feynman -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

lol: Q.E.D.

+ +

+ + +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013311_MIT_Mystery_Hunt_2013_Travels_with_Charlie/13.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013311_MIT_Mystery_Hunt_2013_Travels_with_Charlie/13.jpg new file mode 100644 index 0000000000000000000000000000000000000000..718f0f4670577c66bd6eeb102927cab6ad4497a8 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013311_MIT_Mystery_Hunt_2013_Travels_with_Charlie/13.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d201728b20199892dfd5dcdb77a659dc0c537e2bc677e5b1cb5b1bfde94620df +size 3281 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013311_MIT_Mystery_Hunt_2013_Travels_with_Charlie/38.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013311_MIT_Mystery_Hunt_2013_Travels_with_Charlie/38.jpg new file mode 100644 index 0000000000000000000000000000000000000000..dfdc915bf23dda60d5c63151e318bcd363a9d788 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013311_MIT_Mystery_Hunt_2013_Travels_with_Charlie/38.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:db2026548623642abf75a798366caacbbdb84cf2d135039f665a425b8cb14121 +size 3122 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013314_MIT_Mystery_Hunt_2013_A_Strange_Puzzle/16.jpg b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013314_MIT_Mystery_Hunt_2013_A_Strange_Puzzle/16.jpg new file mode 100644 index 0000000000000000000000000000000000000000..039270cfaf4926e4fcf311043a36d0ae211215fc --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013314_MIT_Mystery_Hunt_2013_A_Strange_Puzzle/16.jpg @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bc5e66dce9ed41889cc1e20ccf59328134f04fa54240d94f53b34afde774ee26 +size 3179 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013424_MIT_Mystery_Hunt_2013_Phone_Tag/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013424_MIT_Mystery_Hunt_2013_Phone_Tag/index.html new file mode 100644 index 0000000000000000000000000000000000000000..4ba30e7f532191b422e2abe0c8aa9425828f3f4c --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013424_MIT_Mystery_Hunt_2013_Phone_Tag/index.html @@ -0,0 +1,109 @@ + + + +Phone Tag -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

Phone Tag

+ +

[Note: This puzzle broke :( The answer is RIOT.]

+ +

Original Instructions

+

Use a SIP client to call sip:wagner@coinheist.com.

+

Or, if you cannot, you can instead call +1 617 945 8221.

+

We ask that you use SIP if you can, as we have limited resources for the phone number. Both go to exactly the same thing.

+ +

Solved

+
+ +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013428_MIT_Mystery_Hunt_2013_Analogy_Farm/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013428_MIT_Mystery_Hunt_2013_Analogy_Farm/index.html new file mode 100644 index 0000000000000000000000000000000000000000..6c99a86cac5876dffbba2053c5ff560e99a1ad73 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013428_MIT_Mystery_Hunt_2013_Analogy_Farm/index.html @@ -0,0 +1,104 @@ + + + +Analogy Farm -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

Analogy Farm

+ The puzzle is hosted at this page. The source code for +the puzzle is available. + +

Solved

+
+ +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013433_MIT_Mystery_Hunt_2013_Mergers/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013433_MIT_Mystery_Hunt_2013_Mergers/index.html new file mode 100644 index 0000000000000000000000000000000000000000..5e1364b62bc58f990bc5747b92c434b71e38048a --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013433_MIT_Mystery_Hunt_2013_Mergers/index.html @@ -0,0 +1,120 @@ + + + +Mergers -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + +Mergers + + + + + +
+ +
+ +
+ + +
+ +

Mergers

+ +

Aardvark
+Burger
+City
+Damsel
+Dr. Horrible
+Element
+Information
+Mac OS X
+Nadia
+Point Count
+Policeman
+Rapid Transit
+Roman
+Stephen
+Twenty
+Windy +

+ +

Solved

+
+ +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013438_MIT_Mystery_Hunt_2013_Transit_Links/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013438_MIT_Mystery_Hunt_2013_Transit_Links/index.html new file mode 100644 index 0000000000000000000000000000000000000000..a6389279fe91c4178a1d942090e6a5d88e1b0f7c --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013438_MIT_Mystery_Hunt_2013_Transit_Links/index.html @@ -0,0 +1,107 @@ + + + +Transit Links -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + +Transit Links + + + + + +
+ +
+ +
+ + +
+ +

Transit Links

+ +

+Indiana Jones is excavating a site, and finds remains of two civilizations, each with their own rail system. But stuff is so +jumbled up that he can't figure out which stations are from which civilization. +

Transit Links + +

Solved

+
+ +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit20135m2_MIT_Mystery_Hunt_2013_Air_Traffic_Control/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit20135m2_MIT_Mystery_Hunt_2013_Air_Traffic_Control/index.html new file mode 100644 index 0000000000000000000000000000000000000000..e5dfed2377a61d89eeffcbd8dafcdb8f2bd01a11 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit20135m2_MIT_Mystery_Hunt_2013_Air_Traffic_Control/index.html @@ -0,0 +1,121 @@ + + + +Air Traffic Control -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +
+
Air Traffic Control [SOLVED]
+
+ +
+If you wanted to crash some planes... never mind, let's not go there.
+
+This Air Traffic Control computer should have another piece of the
+cryptosystem's backdoor. Try not to raise any red flags while you're in there.
+
+-Alyssa
+

+Connected to atc.meta.gov.
+
+  Downloading...
+  Received atc.pdf.
+
+[Connection closed]
+
+ +
+
+ +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013603_MIT_Mystery_Hunt_2013_Agricultural_Operations/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013603_MIT_Mystery_Hunt_2013_Agricultural_Operations/index.html new file mode 100644 index 0000000000000000000000000000000000000000..0c46039b3bea42c619ae99d0e47402bf640aa431 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013603_MIT_Mystery_Hunt_2013_Agricultural_Operations/index.html @@ -0,0 +1,105 @@ + + + +Agricultural Operations -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

Solved: Agricultural Operations

+ +

When farmer Quint plants his field with his 25 kinds of plants, he makes sure that within each square plot each row and column forms the same set of distinct plants, and he never puts the same kind of plant in two different plots.

Main puzzle + + +
+ + +
+
+
+ + +
+

Status:

+ +
+ + +
+
+ + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013620_MIT_Mystery_Hunt_2013_Underbrush/asset_index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013620_MIT_Mystery_Hunt_2013_Underbrush/asset_index.html new file mode 100644 index 0000000000000000000000000000000000000000..b20edd196736591714469e1eaf1332c305cf8f4d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit2013620_MIT_Mystery_Hunt_2013_Underbrush/asset_index.html @@ -0,0 +1,114 @@ + + + +Underbrush (Solution) -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

Underbrush (Solution)

+

by Lilly Chin and Brooks Withrow, based on an idea by Matt Granoff

+ +

After reading through these journal entries, you realize +that the cities and routes on the camping trips all correspond to cities and +routes in the Pokemon universe based on structures +mentioned in the journal entries.

+ +

So in each camping trip, the following journeys happen:

+ +

Camping Trip #1

+
    +
  1. Start in Saffron
  2. +
  3. Head to Cerulean via Route 5
  4. +
  5. Head to Lavender via Route 9, 10 and Rock Tunnel
  6. +
  7. Head to Saffron via Route 8
  8. +
  9. Head to Vermillion via Route 6
  10. +
  11. Head to Lavender via Route 11 and Route 12
  12. +
  13. Return to Vermillion (route order does not matter)
  14. +
+ +

Camping Trip #2

+
    +
  1. Start in Violet
  2. +
  3. Head to Azalea via Ruins of Alpha, Route 32, 33 and Union Cave
  4. +
  5. Head to Goldenrod via Ilex Forest and Route 34
  6. +
  7. Head to Violet via National Park and Route 35, 36
  8. +
+ +

Camping Trip #3

+
    +
  1. Start in Pallet Town
  2. +
  3. Head to Viridian via Route 1
  4. +
  5. Head to Pewter via Route 2 / Viridian Forest
  6. +
+ +

Camping Trip #4

+
    +
  1. Start at top of Route 17 / Cycling Road
  2. +
  3. Head to Fuchsia / Safari Zone
  4. +
+ +

Shading in the routes traveled for each camping trip draws +out a letter on the Kanto / Johto region map.

+ + + +

Reading the letters in order of camping +trip gives us our final answer: BOIL.

+ +
+ + +
+
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit20136m6_MIT_Mystery_Hunt_2013_Yellow_Flag/asset_index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit20136m6_MIT_Mystery_Hunt_2013_Yellow_Flag/asset_index.html new file mode 100644 index 0000000000000000000000000000000000000000..cf005ba4f47d54465c79a0f48f1a8b4a771b2934 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2013/mit20136m6_MIT_Mystery_Hunt_2013_Yellow_Flag/asset_index.html @@ -0,0 +1,124 @@ + + + +Yellow Flag (Solution) -- COINHEIST + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+ + +
+ +

Yellow Flag (Solution)

+

by Derek Kisman, based on an idea by Amos Eshel

+ +
+
+ Here is an unordered list of answers to the twenty round puzzles, for reference. + The colors identify which puzzle answer this is (e.g. DAMP + is the answer to the red/green edge cubelet). + + +
+        RYB   SHLEP
+        RY    EXTANT
+        RYG   DEDITION
+        RG    DAMP
+        RWG   BOIL
+        RW    UNARY
+        RWB   CONTIGUOUS
+        RB    BASSIST
+        YB    SLAUGHTER
+        YG    BEER CHUGGING
+        WG    EDITH PIAF
+        WB    CREAM OF TARTAR
+        OYB   ARMORED RECON
+        OY    HYPAPANTE
+        OYG   COMMEMORATIVE BATS
+        OG    DERRICK TRUCK
+        OWG   BROWN ROT
+        OW    ATTORNEYS GENERAL
+        OWB   SACROSANCT
+        OB    IMPROMPTU
+    
+
+
+ +

At each position 1-9 of these answers (ignoring spaces), a single letter is repeated across two answers (e.g. there are two words that start with S, two that have second letter E, etc). These letters additionally spell out SEMAPHORE. Forming a semaphore flag by the two positions the answers are in (orientation is provided by red being on the ‘north’ side), and reading in the order of SEMAPHORE spells out the answer, WONDERING.

+ +
+  NW   DEDITION
+  N    EXTANT
+  NE   SHLEP
+  E    SLAUGHTER
+  SE   ARMOREDRECON
+  S    HYPAPANTE
+  SW   COMMEMORATIVEBATS
+  W    BEERCHUGGING
+
+ +
+  S NE/E    W
+  E NW/W    O
+  M SE/SW   N
+  A N/S     D
+  P NE/S    E
+  H E/W     R
+  O NW/SW   I
+  R SE/SW   N
+  E SE/S    G
+
+ + +
+ + +
+
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014d3_MIT_Mystery_Hunt_2014_Find_Your_Way_Across/_solution_assets/solution.css b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014d3_MIT_Mystery_Hunt_2014_Find_Your_Way_Across/_solution_assets/solution.css new file mode 100644 index 0000000000000000000000000000000000000000..8c04baf96469cf86223a279a30e694b52774b8b5 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014d3_MIT_Mystery_Hunt_2014_Find_Your_Way_Across/_solution_assets/solution.css @@ -0,0 +1,179 @@ +html { + min-height: 100% +} +body, td, input { + font-family: 'Alice', sans-serif; + font-size: 18px; +} +table { + text-align: left; +} +td { + padding: 2px 4px; +} +#mh-title { + font-family: 'Alice', sans-serif; + font-size: 50px; +} +.mh-flavortext { + font-style: italic; + text-align: center; + margin: 0px 30px; +} +.mh-roundtext { + font-style: italic; + text-align: left; + margin: 0px 30px; +} +#mh-content { + padding: 10px; + text-align: justify; + clear: both; +} +#mh-outer { + width: 900px; +} +#mh-controls { + position: relative; +} +table.mh-center { + margin-left: auto; + margin-right: auto; +} + + +@media screen { + + body { + width: 100%; + margin: 0px; + text-align: center; + } + .mh-fancy #mh-outer { + padding-top: 10px; + display: inline-block; + text-align: left; + position: relative; + } + .mh-fancy #mh-controls { + padding-bottom: 5px; + overflow: hidden; + } + .mh-fancy #mh-controls a, .mh-fancy #mh-controls span { + color: #fff; + text-shadow: 0px 0px 4px #000, 0px 2px 4px #000; + font-size: 90%; + text-decoration: none; + } + .mh-fancy #mh-back { + position: relative; + left: 20px; + } + .mh-fancy #mh-elsewhere { + position: relative; + left: 40px; + } + .mh-fancy #mh-plain-toggle { + position: absolute; + right: 160px; + } + .mh-fancy #mh-answer, .mh-fancy #mh-contact { + position: absolute; + right: 20px; + } + .mh-fancy #mh-page { + background: #fff; + box-shadow: 0px 0px 8px #000; + border-radius: 15px; + overflow: hidden; + margin-bottom: 20px; + } + .mh-fancy #mh-banner { + border-top-left-radius: 15px; + border-top-right-radius: 15px; + } + .mh-fancy #mh-title { + padding: 40px 20px; + text-shadow: 0px 0px 4px #eee; + color: #000; + } + .mh-fancy #mh-content { + color: #000; + border-top: 1px solid #aaa; + border-bottom-left-radius: 15px; + border-bottom-right-radius: 15px; + } + + .mh-plain #mh-controls { + text-align: center; + } + .mh-plain #mh-back { + display: none; + } + .mh-plain #mh-plain-toggle { + position: absolute; + right: 0px; + } + .mh-plain #mh-answer, .mh-plain #mh-contact { + display: none; + } + .mh-plain #mh-title { + text-align: center; + padding: 10px 0px; + } + .mh-plain a { + color: #520; + } + +} + + + +@media print { + #mh-controls { + text-align: center; + } + #mh-back { + display: none; + } + #mh-elsewhere { + display: none; + } + #mh-answer, #mh-plain-toggle, #mh-contact { + display: none; + } + #mh-title { + text-align: center; + } + a { + color: #520; + } +} + + + +@media screen { + body.mh-fancy { + background: #d0ceca url('../../round/mit/background.jpg') no-repeat top center; + } +} + +.t { + border-collapse: collapse; + margin: 0px auto; +} +#mh-outer { + width: 940px !important; +} +.t td { + padding: 1px 0px; + text-align: center; + font-family: arial, sans-serif; + font-size: 15px; + width: 17px; +} +.t td.w { background-color:#d9d2e9; } +.t td.wp { background-color:#c9daf8; } +.t td.wpi { background-color:#6d9eeb; } +.t td.ew { background-color:#cccccc; } + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1c2_MIT_Mystery_Hunt_2014_A_Meta_Puzzle/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1c2_MIT_Mystery_Hunt_2014_A_Meta_Puzzle/index.html new file mode 100644 index 0000000000000000000000000000000000000000..01408f8cb6c601d9231ca2df2bca73f800e8d45b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1c2_MIT_Mystery_Hunt_2014_A_Meta_Puzzle/index.html @@ -0,0 +1,93 @@ + + + + A Meta Puzzle (MIT) + + + + + +
+
+ + Back to MIT + + + Elsewhere + + + + Solution + + +
+
+ + +
+
+ + +
+
+ A Meta Puzzle +
+
+ +
+
    +
  • Toronto, ON — It could use a seraph scratch? +
  • Austin, TX — Curve foe +
  • Los Angeles, CA — A day of rest for your spine +
  • Detroit, MI — Military branch of flesh-eaters +
  • Chicago, IL — Deep red Carrollian parrot +
  • Woonsocket, RI — Choose +
  • Portland, OR — Popular princess +
  • Mobile, AL — Production site for Vulcan prosthetics +
  • Worcester, MA — Van Halen singer in disco boots +
  • Richmond, VA — Like Vader Ripple or Chocolate Chip Maul +
  • Seattle, WA — Positively charged damsel +
  • New Orleans, LA — Apostle acts nosy +
  • Phoenix, AZ — He's between a king and a vassal +
  • Minneapolis, MN — Chinese leader's struggle +
  • Madison, WI — Pant edge that belongs to me! +
  • Savannah, GA — Sometime Kardashian beau +
  • New York, NY — Bread bowl and bear claw bakery +
  • Jacksonville, FL — Doctor Who's Astrid +
  • Fargo, ND — You can hear it drop +
  • Charlotte, NC — Beirut, to some +
  • Pecos, TX — Instrumental composition on coniferous tree +
  • Helena, MT — Oscar-winning Monster +
  • San Jose, CA — This olympic mascot dude hasn't eaten enough food +
  • Carlsbad, NM — Used to be +
+ +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1cq_MIT_Mystery_Hunt_2014_Technical_Program_Committee_Report/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1cq_MIT_Mystery_Hunt_2014_Technical_Program_Committee_Report/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..9c475b890e2044523b9ffcd78abcda396893d2e9 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1cq_MIT_Mystery_Hunt_2014_Technical_Program_Committee_Report/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/technical_program_committee_report/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1d2_MIT_Mystery_Hunt_2014_Across_the_Hall/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1d2_MIT_Mystery_Hunt_2014_Across_the_Hall/index.html new file mode 100644 index 0000000000000000000000000000000000000000..d646b7f7010f4ebe26d93d51ebf27abd49bc2bd9 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1d2_MIT_Mystery_Hunt_2014_Across_the_Hall/index.html @@ -0,0 +1,104 @@ + + + + Across the Hall (MIT) + + + + + +
+
+ + Back to MIT + + + Elsewhere + + + + Solution + + +
+
+ + +
+
+ + +
+
+ Across the Hall +
+
+ +
+

+EAXLYYTEREVISIONYCOSEDIANYFRKQUESNTLYYCARLEDYUNILEYMIRTIEY +

+PASSIONATHARGENTINDANCTHAPROVERBIALLTAKETWTEXECUT +

+WILDINGQEIINDEERHILTONNRFORTENSKYTUPERMANWARNERCIRECTORFISHERQICHARD +

+PRVIOUSHOTBOFRMGAESHWTHTFETFURESPLNKO +

+DYNIALARINGNIHSUSENIOHTHNIIWROTHYNIODANCHTENILBDNINAPHIANIOS +

+EWERTDPOUNDCLEIMEDYARDBYOUNCETHEFURLONGCHETHEMMETERSCHOOLACREEFFEIRLITER +

+LIXEALXOHOLICDRXNKSSEXVEDWIXHOHUTICXCUXES +

+MMACINDYEMWHJANMPEBOBBYFORIMSMWIPETERHMDRCAROLMASHOPMFOCINDYMINMARCIATANCE +

+STBCMARPUDNIDEJAMPUEIDFGMAFYINPUGTYNOOAIPSUCMENOAANEPUS +

+TAVELEDJROUGHJEKRKKEKRPLANMESPDKRDS +

+TONEYWINEUUNGVIUEUANBEAEUMONTTHEEAUURPROEDUCTIUNWITEHEQUEINUPUUEEPETS +

+LCADECOTTNDMEALNNWSININGNRMACIANOBRWNNOBOKNOFRMNETHNGEIHTIESN +

+KUOFTYNEWTKOUHWORIEPSMHATWLEFIRAGRLETLEPMOCLESPISED +

+HTOMACHAAINGBUNGEANDEARTEAERMINEDWIVAERIAHOUTARAINMAIGUITYTANCREASHAOUGHPALLBLADDERRACISEDPLEENEAAIL +

+WARTIMARKESITCOBSERVEMINSPIREYEDBEHOLDYROGBERECOGNIZETALTMASCERTAINNFILOOKM +

+LEEERKATSVHOOSRINNGSSGAKKUNEASLATTATASVITTHSOUMMBAAS +

+

+


+

+ + +

+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1d4_MIT_Mystery_Hunt_2014_I_Came_Across_a_Japanese_Rose_Garden/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1d4_MIT_Mystery_Hunt_2014_I_Came_Across_a_Japanese_Rose_Garden/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..d3d2eb5dd1a64ac26498d407584a9ceaf1c9674a --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1d4_MIT_Mystery_Hunt_2014_I_Came_Across_a_Japanese_Rose_Garden/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/i_came_across_a_japanese_rose_garden/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1da_MIT_Mystery_Hunt_2014_I_Stumbled_Across_a_Recording/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1da_MIT_Mystery_Hunt_2014_I_Stumbled_Across_a_Recording/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..28b84ccd40840c9b45bee66e9d56fe4e52b769ae --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1da_MIT_Mystery_Hunt_2014_I_Stumbled_Across_a_Recording/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/i_stumbled_across_a_recording/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s4_MIT_Mystery_Hunt_2014_How_Puzzling_All_These_Changes_Are/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s4_MIT_Mystery_Hunt_2014_How_Puzzling_All_These_Changes_Are/index.html new file mode 100644 index 0000000000000000000000000000000000000000..db0d32f367f91f364c8b76f08c851eeca2d87864 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s4_MIT_Mystery_Hunt_2014_How_Puzzling_All_These_Changes_Are/index.html @@ -0,0 +1,83 @@ + + + + How Puzzling All These Changes Are! (MIT) + + + + + +
+
+ + Back to MIT + + + Elsewhere + + + + Solution + + +
+
+ + +
+
+ + +
+
+ How Puzzling All These Changes Are! +
+
+ +
+

(Millennium Fulcrum Edition 3.0)

+ +
+ +

hurried English animals looking silence looking sitting growing Duchess flapper arrived minutes

+

got crowded very the come lefthand had was been trial very many

+

of of of for afraid fish of Five hopeful delightful of of

+

remarkable moment familiarly home some came coming came arm Same him moment

+

was was birds was chrysalis was was roses Duchess across Hearts minutes

+

look too looked door took wood looking tulip-roots too too books soon

+

a so the back Alice minute Hatter's rose-tree forgotten introduced comfortable accidentally

+

expecting existence pretexts expecting next expecting extraordinary anxious next explain next mixed

+

White with with it with little its it bitter with Rabbit its

+

before how talking as up his what Why that checked because I

+

just Just jury just just judging just just just jelly-fish jury-box jumped

+

in her dry whiskers an otherwise as them pleasant his them edge

+ +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s4_MIT_Mystery_Hunt_2014_How_Puzzling_All_These_Changes_Are/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s4_MIT_Mystery_Hunt_2014_How_Puzzling_All_These_Changes_Are/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..635673cd8511381d7aa63d219f309039db0b5c11 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s4_MIT_Mystery_Hunt_2014_How_Puzzling_All_These_Changes_Are/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/how_puzzling_all_these_changes_are/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/_solution_assets/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/_solution_assets/index.html new file mode 100644 index 0000000000000000000000000000000000000000..9fa3e71a64361ffd1fcdec01fe0bfb4a86b20061 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/_solution_assets/index.html @@ -0,0 +1,69 @@ + + + + Build Your Own Sudoku (MIT) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Build Your Own Sudoku

+ +

+Author: Robbie Buckingham +

+ +

Using the clues in approximately the order

+ +

Center – Column 5 – Column 8 – Northeast – Column 6 – Column 7 – Column 4 – Row H – Row E – Row D – Column 1 – Row I – South – West – East – Row F – Southeast – Row G – Northwest – Row C – Column 3 – Column 9 – Southwest – Row B – Row A – North – Column 2

+ +

yields the unsolved grid

+ + +
123456789 +
A265 +
B671 +
C146 +
D9182 +
E396 +
F7823 +
G786 +
H893 +
I512 +
+ +

The solved grid is

+ + +
123456789 +
A872139465 +
B365847129 +
C194526378 +
D946371582 +
E253498617 +
F781265943 +
G439712856 +
H628954731 +
I517683294 +
+ +

Using the numbers from the solved grid, the number clues yield +9-14-20-18-21-19-9-15-14, or INTRUSION.

+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/_solution_assets/solution.css b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/_solution_assets/solution.css new file mode 100644 index 0000000000000000000000000000000000000000..8d1c0dbbebbb84a5bcb464153c413b67b23df983 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/_solution_assets/solution.css @@ -0,0 +1,184 @@ +html { + min-height: 100% +} +body, td, input { + font-family: 'Alice', sans-serif; + font-size: 18px; +} +table { + text-align: left; +} +td { + padding: 2px 4px; +} +#mh-title { + font-family: 'Alice', sans-serif; + font-size: 50px; +} +.mh-flavortext { + font-style: italic; + text-align: center; + margin: 0px 30px; +} +.mh-roundtext { + font-style: italic; + text-align: left; + margin: 0px 30px; +} +#mh-content { + padding: 10px; + text-align: justify; + clear: both; +} +#mh-outer { + width: 900px; +} +#mh-controls { + position: relative; +} +table.mh-center { + margin-left: auto; + margin-right: auto; +} + + +@media screen { + + body { + width: 100%; + margin: 0px; + text-align: center; + } + .mh-fancy #mh-outer { + padding-top: 10px; + display: inline-block; + text-align: left; + position: relative; + } + .mh-fancy #mh-controls { + padding-bottom: 5px; + overflow: hidden; + } + .mh-fancy #mh-controls a, .mh-fancy #mh-controls span { + color: #fff; + text-shadow: 0px 0px 4px #000, 0px 2px 4px #000; + font-size: 90%; + text-decoration: none; + } + .mh-fancy #mh-back { + position: relative; + left: 20px; + } + .mh-fancy #mh-elsewhere { + position: relative; + left: 40px; + } + .mh-fancy #mh-plain-toggle { + position: absolute; + right: 160px; + } + .mh-fancy #mh-answer, .mh-fancy #mh-contact { + position: absolute; + right: 20px; + } + .mh-fancy #mh-page { + background: #fff; + box-shadow: 0px 0px 8px #000; + border-radius: 15px; + overflow: hidden; + margin-bottom: 20px; + } + .mh-fancy #mh-banner { + border-top-left-radius: 15px; + border-top-right-radius: 15px; + } + .mh-fancy #mh-title { + padding: 40px 20px; + text-shadow: 0px 0px 4px #eee; + color: #000; + } + .mh-fancy #mh-content { + color: #000; + border-top: 1px solid #aaa; + border-bottom-left-radius: 15px; + border-bottom-right-radius: 15px; + } + + .mh-plain #mh-controls { + text-align: center; + } + .mh-plain #mh-back { + display: none; + } + .mh-plain #mh-plain-toggle { + position: absolute; + right: 0px; + } + .mh-plain #mh-answer, .mh-plain #mh-contact { + display: none; + } + .mh-plain #mh-title { + text-align: center; + padding: 10px 0px; + } + .mh-plain a { + color: #520; + } + +} + + + +@media print { + #mh-controls { + text-align: center; + } + #mh-back { + display: none; + } + #mh-elsewhere { + display: none; + } + #mh-answer, #mh-plain-toggle, #mh-contact { + display: none; + } + #mh-title { + text-align: center; + } + a { + color: #520; + } +} + + + +@media screen { + body.mh-fancy { + background: #d0ceca url('../../round/mit/background.jpg') no-repeat top center; + } +} + +.sudoku { + border-collapse: collapse; +} +.sudoku th { + width: 20px; + height: 24px; + text-align: center; +} +.sudoku td { + border: 1px solid black; + width: 20px; + height: 24px; + text-align: center; +} +.sudoku .r { + border-right: 3px solid black; +} +.sudoku tr.b td { + border-bottom: 3px solid black; +} +.sudoku tr.t td { + border-top: 3px solid black; +} + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/build_your_own_sudoku b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/build_your_own_sudoku new file mode 100644 index 0000000000000000000000000000000000000000..7f63df6750b870083d2131202686b3ae5ac5868b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/build_your_own_sudoku @@ -0,0 +1,69 @@ + + + + Build Your Own Sudoku (MIT) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Build Your Own Sudoku

+ +

+Author: Robbie Buckingham +

+ +

Using the clues in approximately the order

+ +

Center – Column 5 – Column 8 – Northeast – Column 6 – Column 7 – Column 4 – Row H – Row E – Row D – Column 1 – Row I – South – West – East – Row F – Southeast – Row G – Northwest – Row C – Column 3 – Column 9 – Southwest – Row B – Row A – North – Column 2

+ +

yields the unsolved grid

+ + +
123456789 +
A265 +
B671 +
C146 +
D9182 +
E396 +
F7823 +
G786 +
H893 +
I512 +
+ +

The solved grid is

+ + +
123456789 +
A872139465 +
B365847129 +
C194526378 +
D946371582 +
E253498617 +
F781265943 +
G439712856 +
H628954731 +
I517683294 +
+ +

Using the numbers from the solved grid, the number clues yield +9-14-20-18-21-19-9-15-14, or INTRUSION.

+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..9fa3e71a64361ffd1fcdec01fe0bfb4a86b20061 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s5_MIT_Mystery_Hunt_2014_Build_Your_Own_Sudoku/solution.html @@ -0,0 +1,69 @@ + + + + Build Your Own Sudoku (MIT) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Build Your Own Sudoku

+ +

+Author: Robbie Buckingham +

+ +

Using the clues in approximately the order

+ +

Center – Column 5 – Column 8 – Northeast – Column 6 – Column 7 – Column 4 – Row H – Row E – Row D – Column 1 – Row I – South – West – East – Row F – Southeast – Row G – Northwest – Row C – Column 3 – Column 9 – Southwest – Row B – Row A – North – Column 2

+ +

yields the unsolved grid

+ + +
123456789 +
A265 +
B671 +
C146 +
D9182 +
E396 +
F7823 +
G786 +
H893 +
I512 +
+ +

The solved grid is

+ + +
123456789 +
A872139465 +
B365847129 +
C194526378 +
D946371582 +
E253498617 +
F781265943 +
G439712856 +
H628954731 +
I517683294 +
+ +

Using the numbers from the solved grid, the number clues yield +9-14-20-18-21-19-9-15-14, or INTRUSION.

+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s6_MIT_Mystery_Hunt_2014_Apocalypse/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s6_MIT_Mystery_Hunt_2014_Apocalypse/index.html new file mode 100644 index 0000000000000000000000000000000000000000..881d49e752bee1d054376d4079a7ac03ce29f47d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s6_MIT_Mystery_Hunt_2014_Apocalypse/index.html @@ -0,0 +1,97 @@ + + + + Apocalypse (MIT) + + + + + +
+
+ + Back to MIT + + + Elsewhere + + + + Solution + + +
+
+ + +
+
+ + +
+
+ Apocalypse +
+
+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s7_MIT_Mystery_Hunt_2014_Intersecting_Personalities/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s7_MIT_Mystery_Hunt_2014_Intersecting_Personalities/index.html new file mode 100644 index 0000000000000000000000000000000000000000..373cd6024e91c4ffaaa8daf9e7c7d41b159d8abc --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r1s7_MIT_Mystery_Hunt_2014_Intersecting_Personalities/index.html @@ -0,0 +1,125 @@ + + + + Intersecting Personalities (MIT) + + + + + +
+
+ + Back to MIT + + + Elsewhere + + + + Solution + + +
+
+ + +
+
+ + +
+
+ Intersecting Personalities +
+
+ +
+
+ + + + + +
+
+Ah miss +
+Epic killing juts +
+Exceed left input +
+Ginseng downtime +
+Give boil +
+Grills +
+Grislier mogul +
+Grow auction +
+Guy belt sty +
+Iconic hog ass +
+Inertial amnesiac +
+Manly informed +
+Nth sown wig +
+Own hemp +
+Panda hooter +
+Rad hog +
+Real vine +
+Showing tweet +
+Slots +
+Storm variance +
+Tau omnipotence +
+Thong sprints +
+Try average stroke +
+We ditch web +
+Woman has hats? + + +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r201_MIT_Mystery_Hunt_2014_The_Puzzle_Your_Puzzle_Could_Smell_Like/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r201_MIT_Mystery_Hunt_2014_The_Puzzle_Your_Puzzle_Could_Smell_Like/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..95fc61068efb8962382de46a00ce57540dac0e52 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r201_MIT_Mystery_Hunt_2014_The_Puzzle_Your_Puzzle_Could_Smell_Like/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/the_puzzle_your_puzzle_could_smell_like/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r205_MIT_Mystery_Hunt_2014_Now_Let_s_Create_Melodies/_solution_assets/grid09-soln.png b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r205_MIT_Mystery_Hunt_2014_Now_Let_s_Create_Melodies/_solution_assets/grid09-soln.png new file mode 100644 index 0000000000000000000000000000000000000000..80d737d69b3e60be10cd99b03c6d0a1d92965dde --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r205_MIT_Mystery_Hunt_2014_Now_Let_s_Create_Melodies/_solution_assets/grid09-soln.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f52a7cabb40bd4668888ee68b86dc1b4ca974db8a9f799c2d7522a57805612ed +size 3101 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/_solution_assets/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/_solution_assets/index.html new file mode 100644 index 0000000000000000000000000000000000000000..791fa5a65a152a7b983f0ad42c4cb053930c8e51 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/_solution_assets/index.html @@ -0,0 +1,75 @@ + + + + Hedgehogs and Flamingos (The Tea Party) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Hedgehogs and Flamingos

+ +

+Author: Jason Juang +

+ + + +

The grid represents a croquet field. The title is an allusion to the +equipment used by the Queen of Hearts in her croquet game, as well as (sort of) +a reference to Mike Selinker's "Hedgehogs and Worms" puzzles.

+ +

A ball may score up to 13 points in croquet by passing through the hoops in +the correct order (and direction) and then striking the center peg, as +illustrated in the diagram. Each hoop is marked by a square that is split +diagonally into two halves. Words are clued in order, and must be entered in the +grid following the path that a ball would take around the field. Each hoop +square holds two letters; a different letter is used each time the ball passes +through the hoop.

+ +

Reading the 13 "scoring" letters—the 12 hoop letters in the order they +are used, plus the center peg—spells CHRYSANTHEMUM, which is the +answer.

+ + + + + + + + + + + + + + + + + + + + + + + + +
AnswerClue
MEMCPYFunction that reproduces a range of bytes
GENITALOne of Freud's five stages
NO HELPUseless
PABLOName for a Giant Panda?
KERRYClinton follower
URGEDExhorted
ARTERY93 in Boston, or 101 in Silicon Valley
CUE BALLIt's white and can jump
PESETAEuro predecessor
MANIAObsession
CRABAPPLEFruit for crustaceans?
NON-LATINLike Greek or Arabic scripts
EGYPTIts government fell in 2011
MEDIA LABIt's near East Campus
EUCHRE24 card game that Jack Bauer might like
TRADEWheat for sheep, say
GRUYÈRESwiss cheese
KOLBBQBL favorite Kevin
ARCMINPart of a deg.
AMATEURNot professional
BLOSSOMMayim role
+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/hedgehogs_and_flamingos b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/hedgehogs_and_flamingos new file mode 100644 index 0000000000000000000000000000000000000000..632a4e0880ee7dbc2380de8d6352cae196aabae0 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/hedgehogs_and_flamingos @@ -0,0 +1,75 @@ + + + + Hedgehogs and Flamingos (The Tea Party) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Hedgehogs and Flamingos

+ +

+Author: Jason Juang +

+ + + +

The grid represents a croquet field. The title is an allusion to the +equipment used by the Queen of Hearts in her croquet game, as well as (sort of) +a reference to Mike Selinker's "Hedgehogs and Worms" puzzles.

+ +

A ball may score up to 13 points in croquet by passing through the hoops in +the correct order (and direction) and then striking the center peg, as +illustrated in the diagram. Each hoop is marked by a square that is split +diagonally into two halves. Words are clued in order, and must be entered in the +grid following the path that a ball would take around the field. Each hoop +square holds two letters; a different letter is used each time the ball passes +through the hoop.

+ +

Reading the 13 "scoring" letters—the 12 hoop letters in the order they +are used, plus the center peg—spells CHRYSANTHEMUM, which is the +answer.

+ + + + + + + + + + + + + + + + + + + + + + + + +
AnswerClue
MEMCPYFunction that reproduces a range of bytes
GENITALOne of Freud's five stages
NO HELPUseless
PABLOName for a Giant Panda?
KERRYClinton follower
URGEDExhorted
ARTERY93 in Boston, or 101 in Silicon Valley
CUE BALLIt's white and can jump
PESETAEuro predecessor
MANIAObsession
CRABAPPLEFruit for crustaceans?
NON-LATINLike Greek or Arabic scripts
EGYPTIts government fell in 2011
MEDIA LABIt's near East Campus
EUCHRE24 card game that Jack Bauer might like
TRADEWheat for sheep, say
GRUYÈRESwiss cheese
KOLBBQBL favorite Kevin
ARCMINPart of a deg.
AMATEURNot professional
BLOSSOMMayim role
+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..791fa5a65a152a7b983f0ad42c4cb053930c8e51 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r206_MIT_Mystery_Hunt_2014_Hedgehogs_and_Flamingos/solution.html @@ -0,0 +1,75 @@ + + + + Hedgehogs and Flamingos (The Tea Party) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Hedgehogs and Flamingos

+ +

+Author: Jason Juang +

+ + + +

The grid represents a croquet field. The title is an allusion to the +equipment used by the Queen of Hearts in her croquet game, as well as (sort of) +a reference to Mike Selinker's "Hedgehogs and Worms" puzzles.

+ +

A ball may score up to 13 points in croquet by passing through the hoops in +the correct order (and direction) and then striking the center peg, as +illustrated in the diagram. Each hoop is marked by a square that is split +diagonally into two halves. Words are clued in order, and must be entered in the +grid following the path that a ball would take around the field. Each hoop +square holds two letters; a different letter is used each time the ball passes +through the hoop.

+ +

Reading the 13 "scoring" letters—the 12 hoop letters in the order they +are used, plus the center peg—spells CHRYSANTHEMUM, which is the +answer.

+ + + + + + + + + + + + + + + + + + + + + + + + +
AnswerClue
MEMCPYFunction that reproduces a range of bytes
GENITALOne of Freud's five stages
NO HELPUseless
PABLOName for a Giant Panda?
KERRYClinton follower
URGEDExhorted
ARTERY93 in Boston, or 101 in Silicon Valley
CUE BALLIt's white and can jump
PESETAEuro predecessor
MANIAObsession
CRABAPPLEFruit for crustaceans?
NON-LATINLike Greek or Arabic scripts
EGYPTIts government fell in 2011
MEDIA LABIt's near East Campus
EUCHRE24 card game that Jack Bauer might like
TRADEWheat for sheep, say
GRUYÈRESwiss cheese
KOLBBQBL favorite Kevin
ARCMINPart of a deg.
AMATEURNot professional
BLOSSOMMayim role
+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r209_MIT_Mystery_Hunt_2014_Oyster_Card/oyster_card b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r209_MIT_Mystery_Hunt_2014_Oyster_Card/oyster_card new file mode 100644 index 0000000000000000000000000000000000000000..daf3485e563f8124000041745a0af57e0b2a2719 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r209_MIT_Mystery_Hunt_2014_Oyster_Card/oyster_card @@ -0,0 +1,137 @@ + + + + Oyster Card (The Tea Party) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Oyster Card

+ +

+Author: Jason Juang +

+ +

Each of the three Routes is a Masyu puzzle, a logic puzzle type popularized by Nikoli. Deduce the rules of Subway Masyu, which are an extension of standard Masyu rules: +

    +
  • Make a closed loop that visits all the given circles and does not visit the same station twice. +
  • At a black circle, you must transfer to a different-colored line, and must not transfer at either the station before or the station after. +
  • At a white circle, you must not transfer, but must transfer at either or both of the neighboring stations. +
+

+ +

Any stations that are connected together on the standard Tube map are treated as a single station. For example, Bank and Monument are labeled separately, but the stations are interlinked, and are drawn as such on the map. (The puzzle also makes clear that they are considered a single station by giving the name of the station as "Bank/Monument".)

+ +

For each listed pair of stations, determine how many of the stations (0, 1, or 2) each route visits. Read the resulting three-digits number as a ternary number and convert each to a letter to get the answer PEARL HOMINY.

+ +

Masyu Solutions

+ +Alpha Beta Gamma + +

Itinerary

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Stations + α + β + γ + Answer Letter +
Gospel Oak, Oxford Circus + 0+1 + 1+1 + 0+1 + 121 = P +
Imperial Wharf, Stepney Green + 0+0 + 0+1 + 1+1 + 012 = E +
Bethnal Green, Knightsbridge + 0+0 + 0+0 + 0+1 + 001 = A +
South Hampstead, St. James's Park + 1+1 + 0+0 + 0+0 + 200 = R +
Angel, Euston Square + 1+0 + 0+1 + 0+0 + 110 = L +
Tower Hill, Waterloo + 0+0 + 1+1 + 1+1 + 022 = H +
Euston Square, Paddington + 0+1 + 1+1 + 0+0 + 120 = O +
Covent Garden, Maida Vale + 0+1 + 1+0 + 1+0 + 111 = M +
Earl's Court, Russell Square + 1+0 + 0+0 + 0+0 + 100 = I +
Barking, Victoria + 0+1 + 1+0 + 1+1 + 112 = N +
Ladbroke Grove, St. Paul's + 1+1 + 1+1 + 0+1 + 221 = Y +
+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r212_MIT_Mystery_Hunt_2014_One_Tequila_Two_Tequila_Three_Tequila_Floor/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r212_MIT_Mystery_Hunt_2014_One_Tequila_Two_Tequila_Three_Tequila_Floor/index.html new file mode 100644 index 0000000000000000000000000000000000000000..8ae44397087e717e5ef75a7cee0b80bde936ccb9 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r212_MIT_Mystery_Hunt_2014_One_Tequila_Two_Tequila_Three_Tequila_Floor/index.html @@ -0,0 +1,92 @@ + + + + One Tequila, Two Tequila, Three Tequila, Floor (The Tea Party) + + + + + +
+
+ + Back to The Tea Party + + + Elsewhere + + + + Solution + + +
+
+ + +
+ +
+ + +
+ +
+ One Tequila, Two Tequila, Three Tequila, Floor +
+
+ +
+

+ +

+ +

+ +

+ +

+ +

+ +

+ +

+ +

+ +

+ +

+ + + +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r212_MIT_Mystery_Hunt_2014_One_Tequila_Two_Tequila_Three_Tequila_Floor/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r212_MIT_Mystery_Hunt_2014_One_Tequila_Two_Tequila_Three_Tequila_Floor/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..2630c3acdc93ffed3b6d19cf87258fe8994a5514 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r212_MIT_Mystery_Hunt_2014_One_Tequila_Two_Tequila_Three_Tequila_Floor/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/one_tequila_two_tequila_three_tequila_floor/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r213_MIT_Mystery_Hunt_2014_Uncommon_Nonsense/_solution_assets/solution.css b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r213_MIT_Mystery_Hunt_2014_Uncommon_Nonsense/_solution_assets/solution.css new file mode 100644 index 0000000000000000000000000000000000000000..f8ba7bc85dec12b2fb05908f829ac22bad626d41 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r213_MIT_Mystery_Hunt_2014_Uncommon_Nonsense/_solution_assets/solution.css @@ -0,0 +1,168 @@ +html { + min-height: 100% +} +body, td, input { + font-family: 'Alice', sans-serif; + font-size: 18px; +} +table { + text-align: left; +} +td { + padding: 2px 4px; +} +#mh-title { + font-family: 'Alice', sans-serif; + font-size: 50px; +} +.mh-flavortext { + font-style: italic; + text-align: center; + margin: 0px 30px; +} +.mh-roundtext { + font-style: italic; + text-align: left; + margin: 0px 30px; +} +#mh-content { + padding: 10px; + text-align: justify; + clear: both; +} +#mh-outer { + width: 900px; +} +#mh-controls { + position: relative; +} +table.mh-center { + margin-left: auto; + margin-right: auto; +} + + +@media screen { + + body { + width: 100%; + margin: 0px; + text-align: center; + } + .mh-fancy #mh-outer { + padding-top: 10px; + display: inline-block; + text-align: left; + position: relative; + } + .mh-fancy #mh-controls { + padding-bottom: 5px; + overflow: hidden; + } + .mh-fancy #mh-controls a, .mh-fancy #mh-controls span { + color: #fff; + text-shadow: 0px 0px 4px #000, 0px 2px 4px #000; + font-size: 90%; + text-decoration: none; + } + .mh-fancy #mh-back { + position: relative; + left: 20px; + } + .mh-fancy #mh-elsewhere { + position: relative; + left: 40px; + } + .mh-fancy #mh-plain-toggle { + position: absolute; + right: 160px; + } + .mh-fancy #mh-answer, .mh-fancy #mh-contact { + position: absolute; + right: 20px; + } + .mh-fancy #mh-page { + background: #fff; + box-shadow: 0px 0px 8px #000; + border-radius: 15px; + overflow: hidden; + margin-bottom: 20px; + } + .mh-fancy #mh-banner { + border-top-left-radius: 15px; + border-top-right-radius: 15px; + } + .mh-fancy #mh-title { + padding: 40px 20px; + text-shadow: 0px 0px 4px #eee; + color: #000; + } + .mh-fancy #mh-content { + color: #000; + border-top: 1px solid #aaa; + border-bottom-left-radius: 15px; + border-bottom-right-radius: 15px; + } + + .mh-plain #mh-controls { + text-align: center; + } + .mh-plain #mh-back { + display: none; + } + .mh-plain #mh-plain-toggle { + position: absolute; + right: 0px; + } + .mh-plain #mh-answer, .mh-plain #mh-contact { + display: none; + } + .mh-plain #mh-title { + text-align: center; + padding: 10px 0px; + } + .mh-plain a { + color: #520; + } + +} + + + +@media print { + #mh-controls { + text-align: center; + } + #mh-back { + display: none; + } + #mh-elsewhere { + display: none; + } + #mh-answer, #mh-plain-toggle, #mh-contact { + display: none; + } + #mh-title { + text-align: center; + } + a { + color: #520; + } +} + + + +@media screen { + body.mh-fancy { + background: #7ceeff url('../../round/tea_party/background.jpg') no-repeat top center; + } +} + +table.clues {border-spacing:0; border-collapse:collapse;} +table.clues td {padding: 5px; vertical-align: top;} +table.clues th {text-align: left} +th.spacer {width: 50px} +td.hword {padding-left: 20px; height: 33px; text-align:left; vertical-align: middle; border-collapse:collapse;} +td.vword {padding-top: 20px; width: 30px; height: 100px; text-align: center; vertical-align: top; border-collapse:collapse;} + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r216_MIT_Mystery_Hunt_2014_The_Most_Dangerous_Night/_solution_assets/solution.css b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r216_MIT_Mystery_Hunt_2014_The_Most_Dangerous_Night/_solution_assets/solution.css new file mode 100644 index 0000000000000000000000000000000000000000..5c7aaebe6a06cb292a14832bcbfe93d92fb1b54b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r216_MIT_Mystery_Hunt_2014_The_Most_Dangerous_Night/_solution_assets/solution.css @@ -0,0 +1,185 @@ +html { + min-height: 100% +} +body, td, input { + font-family: 'Alice', sans-serif; + font-size: 18px; +} +table { + text-align: left; +} +td { + padding: 2px 4px; +} +#mh-title { + font-family: 'Alice', sans-serif; + font-size: 50px; +} +.mh-flavortext { + font-style: italic; + text-align: center; + margin: 0px 30px; +} +.mh-roundtext { + font-style: italic; + text-align: left; + margin: 0px 30px; +} +#mh-content { + padding: 10px; + text-align: justify; + clear: both; +} +#mh-outer { + width: 900px; +} +#mh-controls { + position: relative; +} +table.mh-center { + margin-left: auto; + margin-right: auto; +} + + +@media screen { + + body { + width: 100%; + margin: 0px; + text-align: center; + } + .mh-fancy #mh-outer { + padding-top: 10px; + display: inline-block; + text-align: left; + position: relative; + } + .mh-fancy #mh-controls { + padding-bottom: 5px; + overflow: hidden; + } + .mh-fancy #mh-controls a, .mh-fancy #mh-controls span { + color: #fff; + text-shadow: 0px 0px 4px #000, 0px 2px 4px #000; + font-size: 90%; + text-decoration: none; + } + .mh-fancy #mh-back { + position: relative; + left: 20px; + } + .mh-fancy #mh-elsewhere { + position: relative; + left: 40px; + } + .mh-fancy #mh-plain-toggle { + position: absolute; + right: 160px; + } + .mh-fancy #mh-answer, .mh-fancy #mh-contact { + position: absolute; + right: 20px; + } + .mh-fancy #mh-page { + background: #fff; + box-shadow: 0px 0px 8px #000; + border-radius: 15px; + overflow: hidden; + margin-bottom: 20px; + } + .mh-fancy #mh-banner { + border-top-left-radius: 15px; + border-top-right-radius: 15px; + } + .mh-fancy #mh-title { + padding: 40px 20px; + text-shadow: 0px 0px 4px #eee; + color: #000; + } + .mh-fancy #mh-content { + color: #000; + border-top: 1px solid #aaa; + border-bottom-left-radius: 15px; + border-bottom-right-radius: 15px; + } + + .mh-plain #mh-controls { + text-align: center; + } + .mh-plain #mh-back { + display: none; + } + .mh-plain #mh-plain-toggle { + position: absolute; + right: 0px; + } + .mh-plain #mh-answer, .mh-plain #mh-contact { + display: none; + } + .mh-plain #mh-title { + text-align: center; + padding: 10px 0px; + } + .mh-plain a { + color: #520; + } + +} + + + +@media print { + #mh-controls { + text-align: center; + } + #mh-back { + display: none; + } + #mh-elsewhere { + display: none; + } + #mh-answer, #mh-plain-toggle, #mh-contact { + display: none; + } + #mh-title { + text-align: center; + } + a { + color: #520; + } +} + + + +@media screen { + body.mh-fancy { + background: #7ceeff url('../../round/tea_party/background.jpg') no-repeat top center; + } +} + +#mh-outer { + width: 1000px !important; +} +td { + font-size: 14px; +} +.mt td.clue { + text-align: right; +} +.mt P { + margin: 0px; +} +.ans { + color: #c5000b; + padding-bottom: 10px; + text-align: right; +} +.r { + text-align: right; + padding-right: 10px; +} +.s { + padding-left: 20px; +} + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r303_MIT_Mystery_Hunt_2014_Cross-Pollination/_solution_assets/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r303_MIT_Mystery_Hunt_2014_Cross-Pollination/_solution_assets/index.html new file mode 100644 index 0000000000000000000000000000000000000000..af575ddb70179cb0fb302bd4d26e87bb0c1b6df5 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r303_MIT_Mystery_Hunt_2014_Cross-Pollination/_solution_assets/index.html @@ -0,0 +1,88 @@ + + + + Cross-Pollination (The Mock Turtle) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Cross-Pollination

+

Authors: Kevin G. Der and Quinn Mahoney

+ +

Complete the two crosswords. Each BEE 'cross-pollinates' between the grids—an entry will stop at BEE in one grid and continue from the BEE in the other grid.

+

+Those entries are: +

    +
  • IVE BEEN HAD / FRISBEE GAME
  • +
  • ALBEES / AMBEER
  • +
  • HEART BEEPS / WATER BEETLE
  • +
  • SHEBEENS / DE BEERS
  • +
  • COLD BEERS / DONT BE EVIL
  • +
  • GO BEEP / US BEEF
  • +
  • SUGAR BEETS / BLUE BEECH
  • +
  • TUBE EYE / WILDEBEEST
  • +
+

+
+ + + + + +
+
+

+Each crossword grid provides a clue when folded into the origami flower above it.
+Fold the left grid into a poinsettia and read counterclockwise for WEDS TECH.
+Fold the right grid into a rose and read in the center for FRI NYT. +

+
+ + + + + +
+
+

+ +Complete the crossword in The Tech from the Wednesday before the Hunt (January 15), and fold it into a sunflower, revealing the word NUMBER around the petals.
+Complete the crossword in The New York Times from the Friday the Hunt started (January 17), and fold it into a cherry blossom, revealing the word THEORY around the center.
+Incidentally, the newspaper crosswords complete the bee and flower theme by including the entries INTEGRATION BEE and HONEY BEE in either grid.
+The answer to this puzzle is NUMBER THEORY. +

+
+ + + + + +
+ +

+Here are all four completed crosswords (PDF), for anyone who would like to try the origami. +

+

+Note that the January 17 print edition of the New York Times contained the wrong crossword puzzle. The correct crossword appeared instead in the January 24 print edition. +

+
+ + +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r303_MIT_Mystery_Hunt_2014_Cross-Pollination/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r303_MIT_Mystery_Hunt_2014_Cross-Pollination/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..af575ddb70179cb0fb302bd4d26e87bb0c1b6df5 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r303_MIT_Mystery_Hunt_2014_Cross-Pollination/solution.html @@ -0,0 +1,88 @@ + + + + Cross-Pollination (The Mock Turtle) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Cross-Pollination

+

Authors: Kevin G. Der and Quinn Mahoney

+ +

Complete the two crosswords. Each BEE 'cross-pollinates' between the grids—an entry will stop at BEE in one grid and continue from the BEE in the other grid.

+

+Those entries are: +

    +
  • IVE BEEN HAD / FRISBEE GAME
  • +
  • ALBEES / AMBEER
  • +
  • HEART BEEPS / WATER BEETLE
  • +
  • SHEBEENS / DE BEERS
  • +
  • COLD BEERS / DONT BE EVIL
  • +
  • GO BEEP / US BEEF
  • +
  • SUGAR BEETS / BLUE BEECH
  • +
  • TUBE EYE / WILDEBEEST
  • +
+

+
+ + + + + +
+
+

+Each crossword grid provides a clue when folded into the origami flower above it.
+Fold the left grid into a poinsettia and read counterclockwise for WEDS TECH.
+Fold the right grid into a rose and read in the center for FRI NYT. +

+
+ + + + + +
+
+

+ +Complete the crossword in The Tech from the Wednesday before the Hunt (January 15), and fold it into a sunflower, revealing the word NUMBER around the petals.
+Complete the crossword in The New York Times from the Friday the Hunt started (January 17), and fold it into a cherry blossom, revealing the word THEORY around the center.
+Incidentally, the newspaper crosswords complete the bee and flower theme by including the entries INTEGRATION BEE and HONEY BEE in either grid.
+The answer to this puzzle is NUMBER THEORY. +

+
+ + + + + +
+ +

+Here are all four completed crosswords (PDF), for anyone who would like to try the origami. +

+

+Note that the January 17 print edition of the New York Times contained the wrong crossword puzzle. The correct crossword appeared instead in the January 24 print edition. +

+
+ + +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r305_MIT_Mystery_Hunt_2014_Assemble_Me/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r305_MIT_Mystery_Hunt_2014_Assemble_Me/index.html new file mode 100644 index 0000000000000000000000000000000000000000..7f3a6d967cf3ffbf97ad26c115598d291f0dc55c --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r305_MIT_Mystery_Hunt_2014_Assemble_Me/index.html @@ -0,0 +1,97 @@ + + + + Assemble Me (The Mock Turtle) + + + + + +
+
+ + Back to The Mock Turtle + + + Elsewhere + + + + Solution + + +
+
+ + +
+ +
+ Assemble Me +
+
+ +
+

+Help! I just found this program in an unpublished issue of RUN magazine, but I can't seem to get it to work! I think the editors may have mixed up some of the data lines. I guess that's why the issue never made it to print! +

+ +

+10 X=0
+20 READ Y
+30 IF Y=256 GOTO 70
+40 POKE 49152+X,Y
+50 X=X+1
+60 GOTO 20
+70 SYS 49152
+80 END
+90 REM ASSEMBLE ME DATA
+??? DATA 121,96,192,153,0,193,200,192,35,208,240
+??? DATA 144,2,169,42,32,210,255,200
+??? DATA 162,0,160,0,169,32,24,30,0,193
+??? DATA 162,0,185,64,192,32,210,255,200,192,32
+??? DATA 192,8,208,238,232,224,35
+??? DATA 208,231,169,13,32,210,255,96
+??? DATA 208,245,160,0,24,152,121,129,235
+170 DATA 147,13,84,72,69,32,65,78,83,87,69,82,32,84,79,32
+180 DATA 84,72,69,32,80,85,90,90,76,69,32,73,83,58,13,13
+190 DATA 234,240,225,241,117,133,131,232,71,32,197,209,154
+200 DATA 34,45,0,203,155,38,179,185,181,150,19,179,158,175
+210 DATA 173,36,157,157,137,167,18,144
+220 DATA 256
+

+ +

+VICE emulator: a useful resource for this puzzle
+Click here for some additional helpful tips.
+

+ +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r307_MIT_Mystery_Hunt_2014_Falling_Into_Place/_solution_assets/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r307_MIT_Mystery_Hunt_2014_Falling_Into_Place/_solution_assets/index.html new file mode 100644 index 0000000000000000000000000000000000000000..bc434899f8c56ff1e49155c343003119dfa2fb6e --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r307_MIT_Mystery_Hunt_2014_Falling_Into_Place/_solution_assets/index.html @@ -0,0 +1,66 @@ + + + + Falling into Place (The Mock Turtle) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Falling Into Place

+Authors: Kevin G. Der and Roger Hanna Morash + +

The puzzle is presented as a game of Tetris with the following changes:
+

    +
  • Each block in a tetris piece contains either a letter or a black square.
    +
  • In addition to the standard game controls, the letters within the tetris piece can be rotated without changing the piece's orientation.
  • +
  • A crossword-style clue and a graphical representation of an answer word are shown. The length and horizontal orientation of the word is displayed. Occasionally, one or more of the letter spaces will be highlighted.
  • +
+ +

Correctly spelling the current answer word within the tetris board, bounded by either empty +space, the board walls, or black squares, will advance to the next clue. Simultaneously, a +vertical entry with its clue is revealed, but the answer is not given. Completing all the horizontal +answer words will end the game.

+ +

The horizontal answer words are given alphabetically by clue. Dying will revert backwards one +horizontal answer word. Completing a tetris will reveal the next letter in the graphical +representation of the answer word to be spelled, starting at the beginning. +After the game ends, the solver must realize the answer words can be used to rebuild a +crossword. The answer words and their clues are shown below in final output order, with newest +at the top. + +

Determining the vertical answers and reassembling the crossword using the highlighted +squares as a guide yields the result below. Each of the standard 7 tetris pieces appears +twice as black square groups. The entries from tetris must be placed in the grid according +to their original orientation, i.e. horizontally or vertically. The highlighted letters (top right, +middle, and bottom left) spell PRIME CLUE HEADS. + +

PRIME CLUE HEADS instructs the solver to look at the clues with prime numbers and +read the first letters. The numbers to the clues can be obtained with standard crossword +square numbering. +The first letters of the prime numbered clues, when read in the standard crossword order (across clues, then +down clues), spell LETTERS THAT TOUCH 2 PIECES. + +

Following those instructions, find those letters touching two tetris pieces in the +crossword grid. Those letters, when read in order, spell SKYFALL OO AGENT, so the answer is +JAMES BOND + +

The full solution with the resulting clues and grids is here. + +

+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r307_MIT_Mystery_Hunt_2014_Falling_Into_Place/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r307_MIT_Mystery_Hunt_2014_Falling_Into_Place/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..bc434899f8c56ff1e49155c343003119dfa2fb6e --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r307_MIT_Mystery_Hunt_2014_Falling_Into_Place/solution.html @@ -0,0 +1,66 @@ + + + + Falling into Place (The Mock Turtle) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Falling Into Place

+Authors: Kevin G. Der and Roger Hanna Morash + +

The puzzle is presented as a game of Tetris with the following changes:
+

    +
  • Each block in a tetris piece contains either a letter or a black square.
    +
  • In addition to the standard game controls, the letters within the tetris piece can be rotated without changing the piece's orientation.
  • +
  • A crossword-style clue and a graphical representation of an answer word are shown. The length and horizontal orientation of the word is displayed. Occasionally, one or more of the letter spaces will be highlighted.
  • +
+ +

Correctly spelling the current answer word within the tetris board, bounded by either empty +space, the board walls, or black squares, will advance to the next clue. Simultaneously, a +vertical entry with its clue is revealed, but the answer is not given. Completing all the horizontal +answer words will end the game.

+ +

The horizontal answer words are given alphabetically by clue. Dying will revert backwards one +horizontal answer word. Completing a tetris will reveal the next letter in the graphical +representation of the answer word to be spelled, starting at the beginning. +After the game ends, the solver must realize the answer words can be used to rebuild a +crossword. The answer words and their clues are shown below in final output order, with newest +at the top. + +

Determining the vertical answers and reassembling the crossword using the highlighted +squares as a guide yields the result below. Each of the standard 7 tetris pieces appears +twice as black square groups. The entries from tetris must be placed in the grid according +to their original orientation, i.e. horizontally or vertically. The highlighted letters (top right, +middle, and bottom left) spell PRIME CLUE HEADS. + +

PRIME CLUE HEADS instructs the solver to look at the clues with prime numbers and +read the first letters. The numbers to the clues can be obtained with standard crossword +square numbering. +The first letters of the prime numbered clues, when read in the standard crossword order (across clues, then +down clues), spell LETTERS THAT TOUCH 2 PIECES. + +

Following those instructions, find those letters touching two tetris pieces in the +crossword grid. Those letters, when read in order, spell SKYFALL OO AGENT, so the answer is +JAMES BOND + +

The full solution with the resulting clues and grids is here. + +

+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r310_MIT_Mystery_Hunt_2014_Introduction_to_Collegiate_Notetaking/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r310_MIT_Mystery_Hunt_2014_Introduction_to_Collegiate_Notetaking/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..c74a016aef0bd281c3cbb4e3f3e2771a1bb45e39 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r310_MIT_Mystery_Hunt_2014_Introduction_to_Collegiate_Notetaking/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/introduction_to_collegiate_notetaking/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r312_MIT_Mystery_Hunt_2014_Stronghold_Fire/rack9.png b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r312_MIT_Mystery_Hunt_2014_Stronghold_Fire/rack9.png new file mode 100644 index 0000000000000000000000000000000000000000..927af995d651a2f98c3acb133b8437b3e09702a6 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r312_MIT_Mystery_Hunt_2014_Stronghold_Fire/rack9.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3ef2447ee0840f58c2c6a1f893c09a9903e8fd3ec9adb683e9fb37250c9a3080 +size 3218 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r313_MIT_Mystery_Hunt_2014_Only_Carmen_Sandiego_Explores_Nigh_Unstoppably/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r313_MIT_Mystery_Hunt_2014_Only_Carmen_Sandiego_Explores_Nigh_Unstoppably/index.html new file mode 100644 index 0000000000000000000000000000000000000000..952fadf605b68dd502bb2daf62b9d3cb54dd94ef --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r313_MIT_Mystery_Hunt_2014_Only_Carmen_Sandiego_Explores_Nigh_Unstoppably/index.html @@ -0,0 +1,115 @@ + + + + Only Carmen Sandiego Explores Nigh Unstoppably (The Mock Turtle) + + + + + +
+
+ + Back to The Mock Turtle + + + Elsewhere + + + + Solution + + +
+
+ + +
+ +
+ Only Carmen Sandiego Explores Nigh Unstoppably +
+
+ +
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r313_MIT_Mystery_Hunt_2014_Only_Carmen_Sandiego_Explores_Nigh_Unstoppably/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r313_MIT_Mystery_Hunt_2014_Only_Carmen_Sandiego_Explores_Nigh_Unstoppably/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..f60d62b76147985772ea521a687077cdadb01a96 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r313_MIT_Mystery_Hunt_2014_Only_Carmen_Sandiego_Explores_Nigh_Unstoppably/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/only_carmen_sandiego_explores_nigh_unstoppably/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r3x_MIT_Mystery_Hunt_2014_Mock_Turtle_Meta/mock_turtle b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r3x_MIT_Mystery_Hunt_2014_Mock_Turtle_Meta/mock_turtle new file mode 100644 index 0000000000000000000000000000000000000000..1f5bb67201d35ed2c298dcf5574a7ea6725d9767 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r3x_MIT_Mystery_Hunt_2014_Mock_Turtle_Meta/mock_turtle @@ -0,0 +1,103 @@ + + + + The Mock Turtle + + + + +
+
+ + Back + +
+
+ + +
+

Solution to The Mock Turtle Meta

+ +Authors: David Wilson and Erin Rhode + +

[Post-Hunt erratum: The eighth clue below was +misprinted in the actual Hunt. The intended clue is below. We've gone +over our version control logs and honestly have no idea how this +happened. We're very very sorry.]

+ +

The Mock Turtle is "made of bits and pieces of other beings." +Each of the blanks can be filled by a round-answer word. This forms a +clue that can be answered by a phrase that is exactly two letters off +from the name of a Carrollian character (or creature).

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Clue with answer wordAnswer to clueChanged creature
JAMES BOND creator and family (26,13)FLEMINGSFLAMINGO
SNOOPY's airplane (in reality) (15,1) DOGHOUSEDORMOUSE
A.A. MILNE's "very small" character (5,2) PIGLET EAGLET
Beverage endorsed by TED WILLIAMS (14,9)MOXIEMOUSE
Container for WARDLEY product (10,25)FISH FOOD CANFISH FOOTMAN
First word of LEVAR BURTON's children's TV show name (6,3)READINGRED KING
Focus of DOWNFALL meme (17,8)(MAD) HITLER(MAD) HATTER
How "these LOCKS" were preserv'd (7,22)UNSHORNUNICORN
Lancaster and CORNWALL, for example (4,21)DUCHIESDUCHESS
Primary developer of the NUMBER THEORY library (20,24)SHOUPSHEEP
Send email to experts on the TORAH (23,16)WRITE RABBISWHITE RABBIT
Usin' a TI85, perhaps? (12,11)GRAPHIN'GRYPHON
What WORMTONGUE does, before being shot (18,19)KILL THE WIZARDBILL THE LIZARD
+ +

Take the extra "bits" of the other creatures, order them by using the +given indices, and you'll find out how to make more people fit at the +tea-table: MAKE EDITS TO YOUR TABLE SCHEMA.

+ +
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r408_MIT_Mystery_Hunt_2014_Another_Puzzle_with_the_Answer_SULLIVAN/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r408_MIT_Mystery_Hunt_2014_Another_Puzzle_with_the_Answer_SULLIVAN/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..01197b6a3fb53d83a3e6a3d41ae228a13b94c134 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r408_MIT_Mystery_Hunt_2014_Another_Puzzle_with_the_Answer_SULLIVAN/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/another_puzzle_with_answer_sullivan/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r411_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_EIGHT_DAYS_A_WEEK/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r411_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_EIGHT_DAYS_A_WEEK/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..7bb5bf7cac4c97b3d3ee86bb4cf686f3656f0199 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r411_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_EIGHT_DAYS_A_WEEK/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/puzzle_with_answer_eight_days_a_week/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r412_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_NORWEGIAN_WOOD/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r412_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_NORWEGIAN_WOOD/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..34d9ee3bb68754d9ccd5dc52b04d371e6598a558 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r412_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_NORWEGIAN_WOOD/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/puzzle_with_answer_norwegian_wood/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r414_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_I_WANT_TO_HOLD_YOUR_H/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r414_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_I_WANT_TO_HOLD_YOUR_H/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..36531b1c7fcb81d48e372dab0fd032220a50e78a --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r414_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_I_WANT_TO_HOLD_YOUR_H/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/puzzle_with_answer_i_want_to_hold_your_hand/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r415_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_A_HARD_DAY_S_NIGHT/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r415_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_A_HARD_DAY_S_NIGHT/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..d6596e9a716ba42a761fe497e845a73c1de72369 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r415_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_A_HARD_DAY_S_NIGHT/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/puzzle_with_answer_a_hard_days_night/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r417_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_AND_I_LOVE_HER/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r417_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_AND_I_LOVE_HER/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..2472e2eaf91131d0ac7282ebf287871d55c64805 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r417_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_AND_I_LOVE_HER/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/puzzle_with_answer_and_i_love_her/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r418_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_CAN_T_BUY_ME_LOVE/_solution_assets/solution.css b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r418_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_CAN_T_BUY_ME_LOVE/_solution_assets/solution.css new file mode 100644 index 0000000000000000000000000000000000000000..b426d15a583d34b0b1cb3925019ef27744e19228 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r418_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_CAN_T_BUY_ME_LOVE/_solution_assets/solution.css @@ -0,0 +1,189 @@ +html { + min-height: 100% +} +body, td, input { + font-family: 'Alice', sans-serif; + font-size: 18px; +} +table { + text-align: left; +} +td { + padding: 2px 4px; +} +#mh-title { + font-family: 'Alice', sans-serif; + font-size: 50px; +} +.mh-flavortext { + font-style: italic; + text-align: center; + margin: 0px 30px; +} +.mh-roundtext { + font-style: italic; + text-align: left; + margin: 0px 30px; +} +#mh-content { + padding: 10px; + text-align: justify; + clear: both; +} +#mh-outer { + width: 900px; +} +#mh-controls { + position: relative; +} +table.mh-center { + margin-left: auto; + margin-right: auto; +} + + +@media screen { + + body { + width: 100%; + margin: 0px; + text-align: center; + } + .mh-fancy #mh-outer { + padding-top: 10px; + display: inline-block; + text-align: left; + position: relative; + } + .mh-fancy #mh-controls { + padding-bottom: 5px; + overflow: hidden; + } + .mh-fancy #mh-controls a, .mh-fancy #mh-controls span { + color: #fff; + text-shadow: 0px 0px 4px #000, 0px 2px 4px #000; + font-size: 90%; + text-decoration: none; + } + .mh-fancy #mh-back { + position: relative; + left: 20px; + } + .mh-fancy #mh-elsewhere { + position: relative; + left: 40px; + } + .mh-fancy #mh-plain-toggle { + position: absolute; + right: 160px; + } + .mh-fancy #mh-answer, .mh-fancy #mh-contact { + position: absolute; + right: 20px; + } + .mh-fancy #mh-page { + background: #fff; + box-shadow: 0px 0px 8px #000; + border-radius: 15px; + overflow: hidden; + margin-bottom: 20px; + } + .mh-fancy #mh-banner { + border-top-left-radius: 15px; + border-top-right-radius: 15px; + } + .mh-fancy #mh-title { + padding: 40px 20px; + text-shadow: 0px 0px 4px #eee; + color: #000; + } + .mh-fancy #mh-content { + color: #000; + border-top: 1px solid #aaa; + border-bottom-left-radius: 15px; + border-bottom-right-radius: 15px; + } + + .mh-plain #mh-controls { + text-align: center; + } + .mh-plain #mh-back { + display: none; + } + .mh-plain #mh-plain-toggle { + position: absolute; + right: 0px; + } + .mh-plain #mh-answer, .mh-plain #mh-contact { + display: none; + } + .mh-plain #mh-title { + text-align: center; + padding: 10px 0px; + } + .mh-plain a { + color: #520; + } + +} + + + +@media print { + #mh-controls { + text-align: center; + } + #mh-back { + display: none; + } + #mh-elsewhere { + display: none; + } + #mh-answer, #mh-plain-toggle, #mh-contact { + display: none; + } + #mh-title { + text-align: center; + } + a { + color: #520; + } +} + + + +@media screen { + body.mh-fancy { + background: #74b87d url('../../round/white_queen/background.jpg') no-repeat top center; + } +} + +.vid { + border: 1px solid black; + height: 72px; + padding: 8px; + text-align: center; +} +.v { + margin-top: 18px; + margin-bototm: 18px; +} +.vname { + font-weight: bold; +} +.vdesc { + margin-left: 24px; +} +.vsid, .vsd, .vjs { + display: inline; + margin-left: 24px; +} +.vjs IMG { + vertical-align: middle; +} +.rebus TD { + text-align: center; +} +.rimg TD { + font-size: 54px; +} diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r418_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_CAN_T_BUY_ME_LOVE/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r418_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_CAN_T_BUY_ME_LOVE/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..97406be6e3fa46fd84cecdb21899b515a74e4ed8 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r418_MIT_Mystery_Hunt_2014_A_Puzzle_with_the_Answer_CAN_T_BUY_ME_LOVE/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/puzzle_with_answer_cant_buy_me_love/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/_solution_assets/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/_solution_assets/index.html new file mode 100644 index 0000000000000000000000000000000000000000..11cad309efa1aa7e9463f4bc1ac888a7cac397f2 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/_solution_assets/index.html @@ -0,0 +1,47 @@ + + + + Hole Wizard (The Red and White Knights) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Hole Wizard

+Authors: Harrison Bralower and Erin Rhode + +

The solver opens this puzzle and sees a link to a solid model of a plate with 255 holes in it of various sizes and a numbered list of clues. The puzzle title, Hole Wizard, refers to the feature in Solidworks that automatically makes holes of varying sizes. The solid model can be opened in Solidworks, the free Solidworks eDrawings Viewer, or pretty much any CAD program.

+ +

Every hole in the part is a size found in a machinist's index of standard imperial drill sizes. The drills are ordered and indexed in numbers and letters from the smallest (#99) to the largest (Z). Measuring every hole on the model and comparing the hole sizes to a machinist's drill chart will show that each of the holes in the 15x15 grid (on what we'll call the xy-plane) are letter drills. The grid appears to be total nonsense but is needed later in the puzzle. The holes on the xz- and yz-planes are all number drills.

+ +


+A hole with diameter 3.912 mm (0.154 inches) corresponds to drill size #23.

+ +

The 15x15 letter grid, the number drills going across and down into the part, and the list of clues whose numbers match the number drills all indicate to the solver that this is actually a diagramless crossword puzzle. The corner where the edges with number drills meet is the origin (top left corner) of the grid.

+ +

+The number drills give the location of a crossword answer in the grid, but only its row or column. The same number drills are used for both across and down so the solver must figure out where all the answer words go knowing only what row or column the answer could appear in but not knowing if the answer is across or down. Solving the crossword yields the following complete grid: +

+ +

+ +

+The theme of the crossword is of course holes and the grid even has a hole right in the middle. The random letter grid has not been used up to this point. Overlaying the grid from the solid model onto the complete crossword yields 27 matching letters (i.e. where the letter in the grid matches the gauge of the corresponding hole). These are highlighted in red in the grid above. Reading the matching letters in order (across, then down) we get the clue phrase STATE OF THE ART OR BLADE SURFACE which yields the puzzle answer, and something you need to drill holes into a part: CUTTING EDGE. +

+
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/hole_wizard b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/hole_wizard new file mode 100644 index 0000000000000000000000000000000000000000..c830bf7469cfbe693f19459074e6e11b86dbb66c --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/hole_wizard @@ -0,0 +1,47 @@ + + + + Hole Wizard (The Red and White Knights) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Hole Wizard

+Authors: Harrison Bralower and Erin Rhode + +

The solver opens this puzzle and sees a link to a solid model of a plate with 255 holes in it of various sizes and a numbered list of clues. The puzzle title, Hole Wizard, refers to the feature in Solidworks that automatically makes holes of varying sizes. The solid model can be opened in Solidworks, the free Solidworks eDrawings Viewer, or pretty much any CAD program.

+ +

Every hole in the part is a size found in a machinist's index of standard imperial drill sizes. The drills are ordered and indexed in numbers and letters from the smallest (#99) to the largest (Z). Measuring every hole on the model and comparing the hole sizes to a machinist's drill chart will show that each of the holes in the 15x15 grid (on what we'll call the xy-plane) are letter drills. The grid appears to be total nonsense but is needed later in the puzzle. The holes on the xz- and yz-planes are all number drills.

+ +


+A hole with diameter 3.912 mm (0.154 inches) corresponds to drill size #23.

+ +

The 15x15 letter grid, the number drills going across and down into the part, and the list of clues whose numbers match the number drills all indicate to the solver that this is actually a diagramless crossword puzzle. The corner where the edges with number drills meet is the origin (top left corner) of the grid.

+ +

+The number drills give the location of a crossword answer in the grid, but only its row or column. The same number drills are used for both across and down so the solver must figure out where all the answer words go knowing only what row or column the answer could appear in but not knowing if the answer is across or down. Solving the crossword yields the following complete grid: +

+ +

+ +

+The theme of the crossword is of course holes and the grid even has a hole right in the middle. The random letter grid has not been used up to this point. Overlaying the grid from the solid model onto the complete crossword yields 27 matching letters (i.e. where the letter in the grid matches the gauge of the corresponding hole). These are highlighted in red in the grid above. Reading the matching letters in order (across, then down) we get the clue phrase STATE OF THE ART OR BLADE SURFACE which yields the puzzle answer, and something you need to drill holes into a part: CUTTING EDGE. +

+
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/solution.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/solution.html new file mode 100644 index 0000000000000000000000000000000000000000..11cad309efa1aa7e9463f4bc1ac888a7cac397f2 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r511_MIT_Mystery_Hunt_2014_Hole_Wizard/solution.html @@ -0,0 +1,47 @@ + + + + Hole Wizard (The Red and White Knights) + + + + +
+
+ + Back + +
+
+ + +
+

Solution to Hole Wizard

+Authors: Harrison Bralower and Erin Rhode + +

The solver opens this puzzle and sees a link to a solid model of a plate with 255 holes in it of various sizes and a numbered list of clues. The puzzle title, Hole Wizard, refers to the feature in Solidworks that automatically makes holes of varying sizes. The solid model can be opened in Solidworks, the free Solidworks eDrawings Viewer, or pretty much any CAD program.

+ +

Every hole in the part is a size found in a machinist's index of standard imperial drill sizes. The drills are ordered and indexed in numbers and letters from the smallest (#99) to the largest (Z). Measuring every hole on the model and comparing the hole sizes to a machinist's drill chart will show that each of the holes in the 15x15 grid (on what we'll call the xy-plane) are letter drills. The grid appears to be total nonsense but is needed later in the puzzle. The holes on the xz- and yz-planes are all number drills.

+ +


+A hole with diameter 3.912 mm (0.154 inches) corresponds to drill size #23.

+ +

The 15x15 letter grid, the number drills going across and down into the part, and the list of clues whose numbers match the number drills all indicate to the solver that this is actually a diagramless crossword puzzle. The corner where the edges with number drills meet is the origin (top left corner) of the grid.

+ +

+The number drills give the location of a crossword answer in the grid, but only its row or column. The same number drills are used for both across and down so the solver must figure out where all the answer words go knowing only what row or column the answer could appear in but not knowing if the answer is across or down. Solving the crossword yields the following complete grid: +

+ +

+ +

+The theme of the crossword is of course holes and the grid even has a hole right in the middle. The random letter grid has not been used up to this point. Overlaying the grid from the solid model onto the complete crossword yields 27 matching letters (i.e. where the letter in the grid matches the gauge of the corresponding hole). These are highlighted in red in the grid above. Reading the matching letters in order (across, then down) we get the clue phrase STATE OF THE ART OR BLADE SURFACE which yields the puzzle answer, and something you need to drill holes into a part: CUTTING EDGE. +

+
+ + +
+
+ + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r514_MIT_Mystery_Hunt_2014_The_Revenge_of_Yuki_Nagato_Episode_00/puzzle.js b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r514_MIT_Mystery_Hunt_2014_The_Revenge_of_Yuki_Nagato_Episode_00/puzzle.js new file mode 100644 index 0000000000000000000000000000000000000000..d24d85bdc67a4f2be80921e071d95cf4bf206b02 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r514_MIT_Mystery_Hunt_2014_The_Revenge_of_Yuki_Nagato_Episode_00/puzzle.js @@ -0,0 +1,92 @@ +var mh = {}; +(function($){ + $.fn.disableSelection = function() { + return this + .attr('unselectable', 'on') + .css('user-select', 'none') + .css('user-drag', 'none') + .on('selectstart', false); + }; +})(jQuery); +$('#mh-controls, #mh-controls > *').disableSelection(); +mh.set_iframe_location = function(id, location) { + var iframe = $('#'+id)[0]; + var iframe_window = iframe.contentWindow || iframe.contentDocument.defaultView; + iframe_window.location.replace(location); +}; + +mh.nav = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-nav'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + 20); + var bg = $('#mh-nav-bg'); + $('#mh-nav-inner').html($('#mh-nav-iframe').contents().find('body').html()); + $('#mh-nav-inner a').each(function() { + var href = $(this).attr('href'); + if (href.indexOf('http://') != 0 && href.indexOf('javascript:') != 0) + $(this).attr('href', '../../' + href); + }); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow'); + } else { + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-nav-bg').click(mh.nav); +mh.submit_contact = function() { + var page = $('#mh-page, #mh-book'); + var outer = $('#mh-submit-contact'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-contact-bg'); + var inner = $('#mh-submit-contact-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-contact-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-contact-iframe', '../../dynamic/submit/contact/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-contact-bg').click(mh.submit_contact); + +mh.submit_answer = function() { + var page = $('#mh-page'); + var outer = $('#mh-submit-answer'); + outer.css('top', page.offset().top + 20); + outer.css('left', page.offset().left + page.innerWidth() - 20 - outer.outerWidth()); + var bg = $('#mh-submit-answer-bg'); + var inner = $('#mh-submit-answer-inner'); + bg.stop(true, true); + outer.stop(true, true); + if (outer.is(':visible')) { + bg.fadeTo('fast', 0, function() { + bg.hide(); + }); + outer.fadeToggle('slow', function() { + mh.set_iframe_location('mh-submit-answer-iframe', 'javascript: void 0;'); + }); + } else { + mh.set_iframe_location('mh-submit-answer-iframe', '../../dynamic/submit/puzzle/the_revenge_of_yuki_nagato_episode_00/'); + bg.fadeTo('slow', 0.5); + outer.fadeToggle('slow'); + } +}; +$('#mh-submit-answer-bg').click(mh.submit_answer); + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r606_MIT_Mystery_Hunt_2014_You_ve_Got_Some_Nerve/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r606_MIT_Mystery_Hunt_2014_You_ve_Got_Some_Nerve/index.html new file mode 100644 index 0000000000000000000000000000000000000000..6abb89258980bd8dc0d07fda6b2f2cf572cc144a --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r606_MIT_Mystery_Hunt_2014_You_ve_Got_Some_Nerve/index.html @@ -0,0 +1,92 @@ + + + + You've Got Some Nerve (The Caucus Race) + + + + + +
+
+ + Back to The Caucus Race + + + Elsewhere + + + + Solution + + +
+
+ + +
+ +
+ You've Got Some Nerve +
+
+ +
+
+

+ +

+

+Flower holder subjugatin' *depresses and intorts eyeball*

+Sly animal *senses smell*

+Chancellor Angela vends *shrugs*

+En passant chess pieces *views*

+School for hungry animals *vocalizes*

+Give steroids to Idi *tasted a lot*

+Vehicle decayed *smiles*

+Vietnam Veterans Memorial designer *smells cherry blossoms*

+Mrs. Palin liftin' weights *loses balance*

+Spoken filler from a 1984 gold medalist gymnast *closes jaw*

+Anemic-looking speech filler *looks sideways*

+Purposed as prayer ender *is nosy*

+Expert had a stannum deficiency *shrinks pupils*

+Rejection of clutter from a preppy retail store *talks*

+Manger amendment *lifts voicebox*

+Talons play guitar *takes in the scene*

+Mr. Paul post-makeover *beholds*

+Fare charged to outcasts *synchronizes eye movements*

+Disorder in the coldest place in Tunisia *detects odor*

+Whitefish consumed *cried tears of joy*

+Copernicus, Jonas, Cage, and Tesla *eyelids droop*

+"Gluttony" and "Sloth" for iPhone *turns out eyeballs*

+

+ +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r706_MIT_Mystery_Hunt_2014_Covert_Tops/_solution_assets/solution.css b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r706_MIT_Mystery_Hunt_2014_Covert_Tops/_solution_assets/solution.css new file mode 100644 index 0000000000000000000000000000000000000000..170e51547bae4f7dd08f0bfeecb02a29fee1bf6f --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014r706_MIT_Mystery_Hunt_2014_Covert_Tops/_solution_assets/solution.css @@ -0,0 +1,167 @@ +html { + min-height: 100% +} +body, td, input { + font-family: 'Alice', sans-serif; + font-size: 18px; +} +table { + text-align: left; +} +td { + padding: 2px 4px; +} +#mh-title { + font-family: 'Alice', sans-serif; + font-size: 50px; +} +.mh-flavortext { + font-style: italic; + text-align: center; + margin: 0px 30px; +} +.mh-roundtext { + font-style: italic; + text-align: left; + margin: 0px 30px; +} +#mh-content { + padding: 10px; + text-align: justify; + clear: both; +} +#mh-outer { + width: 900px; +} +#mh-controls { + position: relative; +} +table.mh-center { + margin-left: auto; + margin-right: auto; +} + + +@media screen { + + body { + width: 100%; + margin: 0px; + text-align: center; + } + .mh-fancy #mh-outer { + padding-top: 10px; + display: inline-block; + text-align: left; + position: relative; + } + .mh-fancy #mh-controls { + padding-bottom: 5px; + overflow: hidden; + } + .mh-fancy #mh-controls a, .mh-fancy #mh-controls span { + color: #fff; + text-shadow: 0px 0px 4px #000, 0px 2px 4px #000; + font-size: 90%; + text-decoration: none; + } + .mh-fancy #mh-back { + position: relative; + left: 20px; + } + .mh-fancy #mh-elsewhere { + position: relative; + left: 40px; + } + .mh-fancy #mh-plain-toggle { + position: absolute; + right: 160px; + } + .mh-fancy #mh-answer, .mh-fancy #mh-contact { + position: absolute; + right: 20px; + } + .mh-fancy #mh-page { + background: #fff; + box-shadow: 0px 0px 8px #000; + border-radius: 15px; + overflow: hidden; + margin-bottom: 20px; + } + .mh-fancy #mh-banner { + border-top-left-radius: 15px; + border-top-right-radius: 15px; + } + .mh-fancy #mh-title { + padding: 40px 20px; + text-shadow: 0px 0px 4px #eee; + color: #000; + } + .mh-fancy #mh-content { + color: #000; + border-top: 1px solid #aaa; + border-bottom-left-radius: 15px; + border-bottom-right-radius: 15px; + } + + .mh-plain #mh-controls { + text-align: center; + } + .mh-plain #mh-back { + display: none; + } + .mh-plain #mh-plain-toggle { + position: absolute; + right: 0px; + } + .mh-plain #mh-answer, .mh-plain #mh-contact { + display: none; + } + .mh-plain #mh-title { + text-align: center; + padding: 10px 0px; + } + .mh-plain a { + color: #520; + } + +} + + + +@media print { + #mh-controls { + text-align: center; + } + #mh-back { + display: none; + } + #mh-elsewhere { + display: none; + } + #mh-answer, #mh-plain-toggle, #mh-contact { + display: none; + } + #mh-title { + text-align: center; + } + a { + color: #520; + } +} + + + +@media screen { + body.mh-fancy { + background: #c3e1ef url('../../round/humpty_dumpty/background.jpg') no-repeat top center; + } +} + +body {-webkit-print-color-adjust:exact;} +table.all td.faces {padding-bottom:20px} +table.all td.moves {padding:20px; text-align: right;} +table.face {border-spacing:0; border-collapse:collapse;border:2px solid black; width: 96px; height: 96px;} +td.shaded, td.unshaded {width: 30px; height: 30px; padding: 0px; border-collapse:collapse; text-align: center; border: 1px solid black} +td.shaded {background-color: #999999;} + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z1_MIT_Mystery_Hunt_2014_The_Duchess/grin.png b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z1_MIT_Mystery_Hunt_2014_The_Duchess/grin.png new file mode 100644 index 0000000000000000000000000000000000000000..d16aeb7249d379a923f59ea13c52ab0190d8272d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z1_MIT_Mystery_Hunt_2014_The_Duchess/grin.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ce94a8fcdb735a9ab4a5898eda831a4beb0f79bc3de25127083360514b798a9b +size 3128 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z2_MIT_Mystery_Hunt_2014_The_Queen_of_Hearts/grin.png b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z2_MIT_Mystery_Hunt_2014_The_Queen_of_Hearts/grin.png new file mode 100644 index 0000000000000000000000000000000000000000..d16aeb7249d379a923f59ea13c52ab0190d8272d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z2_MIT_Mystery_Hunt_2014_The_Queen_of_Hearts/grin.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ce94a8fcdb735a9ab4a5898eda831a4beb0f79bc3de25127083360514b798a9b +size 3128 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z3_MIT_Mystery_Hunt_2014_The_Lion_and_the_Unicorn/_solution_assets/solution.css b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z3_MIT_Mystery_Hunt_2014_The_Lion_and_the_Unicorn/_solution_assets/solution.css new file mode 100644 index 0000000000000000000000000000000000000000..4531ef3affe3e72050731f1f601361686ff84c1f --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z3_MIT_Mystery_Hunt_2014_The_Lion_and_the_Unicorn/_solution_assets/solution.css @@ -0,0 +1,181 @@ +html { + min-height: 100% +} +body, td, input { + font-family: 'Alice', sans-serif; + font-size: 18px; +} +table { + text-align: left; +} +td { + padding: 2px 4px; +} +#mh-title { + font-family: 'Alice', sans-serif; + font-size: 50px; +} +.mh-flavortext { + font-style: italic; + text-align: center; + margin: 0px 30px; +} +.mh-roundtext { + font-style: italic; + text-align: left; + margin: 0px 30px; +} +#mh-content { + padding: 10px; + text-align: justify; + clear: both; +} +#mh-outer { + width: 900px; +} +#mh-controls { + position: relative; +} +table.mh-center { + margin-left: auto; + margin-right: auto; +} + + +@media screen { + + body { + width: 100%; + margin: 0px; + text-align: center; + } + .mh-fancy #mh-outer { + padding-top: 10px; + display: inline-block; + text-align: left; + position: relative; + } + .mh-fancy #mh-controls { + padding-bottom: 5px; + overflow: hidden; + } + .mh-fancy #mh-controls a, .mh-fancy #mh-controls span { + color: #fff; + text-shadow: 0px 0px 4px #000, 0px 2px 4px #000; + font-size: 90%; + text-decoration: none; + } + .mh-fancy #mh-back { + position: relative; + left: 20px; + } + .mh-fancy #mh-elsewhere { + position: relative; + left: 40px; + } + .mh-fancy #mh-plain-toggle { + position: absolute; + right: 160px; + } + .mh-fancy #mh-answer, .mh-fancy #mh-contact { + position: absolute; + right: 20px; + } + .mh-fancy #mh-page { + background: #fff; + box-shadow: 0px 0px 8px #000; + border-radius: 15px; + overflow: hidden; + margin-bottom: 20px; + } + .mh-fancy #mh-banner { + border-top-left-radius: 15px; + border-top-right-radius: 15px; + } + .mh-fancy #mh-title { + padding: 40px 20px; + text-shadow: 0px 0px 4px #eee; + color: #000; + } + .mh-fancy #mh-content { + color: #000; + border-top: 1px solid #aaa; + border-bottom-left-radius: 15px; + border-bottom-right-radius: 15px; + } + + .mh-plain #mh-controls { + text-align: center; + } + .mh-plain #mh-back { + display: none; + } + .mh-plain #mh-plain-toggle { + position: absolute; + right: 0px; + } + .mh-plain #mh-answer, .mh-plain #mh-contact { + display: none; + } + .mh-plain #mh-title { + text-align: center; + padding: 10px 0px; + } + .mh-plain a { + color: #520; + } + +} + + + +@media print { + #mh-controls { + text-align: center; + } + #mh-back { + display: none; + } + #mh-elsewhere { + display: none; + } + #mh-answer, #mh-plain-toggle, #mh-contact { + display: none; + } + #mh-title { + text-align: center; + } + a { + color: #520; + } +} + + + +@media screen { + body.mh-fancy { + background: #7ceeff url('../../round/mock_turtle/background.jpg') no-repeat top center; + } +} + +TABLE { + border-collapse: collapse; +} +TD, TH { + border: 1px solid black; + padding: 4px; + text-align: center; +} +.pn { + text-align: left; +} + +.sol TD { + text-align: center; + vertical-align: top; + width: 270px; +} +.moves { + display: inline-block; + text-align: left; +} \ No newline at end of file diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z3_MIT_Mystery_Hunt_2014_The_Lion_and_the_Unicorn/grin.png b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z3_MIT_Mystery_Hunt_2014_The_Lion_and_the_Unicorn/grin.png new file mode 100644 index 0000000000000000000000000000000000000000..d16aeb7249d379a923f59ea13c52ab0190d8272d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z3_MIT_Mystery_Hunt_2014_The_Lion_and_the_Unicorn/grin.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ce94a8fcdb735a9ab4a5898eda831a4beb0f79bc3de25127083360514b798a9b +size 3128 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z4_MIT_Mystery_Hunt_2014_The_Final_Hedge_Maze/grin.png b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z4_MIT_Mystery_Hunt_2014_The_Final_Hedge_Maze/grin.png new file mode 100644 index 0000000000000000000000000000000000000000..d16aeb7249d379a923f59ea13c52ab0190d8272d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z4_MIT_Mystery_Hunt_2014_The_Final_Hedge_Maze/grin.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ce94a8fcdb735a9ab4a5898eda831a4beb0f79bc3de25127083360514b798a9b +size 3128 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z5_MIT_Mystery_Hunt_2014_Where_is_the_White_Rabbit/grin.png b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z5_MIT_Mystery_Hunt_2014_Where_is_the_White_Rabbit/grin.png new file mode 100644 index 0000000000000000000000000000000000000000..d16aeb7249d379a923f59ea13c52ab0190d8272d --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z5_MIT_Mystery_Hunt_2014_Where_is_the_White_Rabbit/grin.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ce94a8fcdb735a9ab4a5898eda831a4beb0f79bc3de25127083360514b798a9b +size 3128 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z5_MIT_Mystery_Hunt_2014_Where_is_the_White_Rabbit/index.html b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z5_MIT_Mystery_Hunt_2014_Where_is_the_White_Rabbit/index.html new file mode 100644 index 0000000000000000000000000000000000000000..cf3e4bb360a34584ba6d1a9bb8f1f977d3af41ea --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2014/mit2014z5_MIT_Mystery_Hunt_2014_Where_is_the_White_Rabbit/index.html @@ -0,0 +1,111 @@ + + + + Where is the White Rabbit? (Runaround) + + + + + +
+
+ + Back to The Final Runaround + + + Elsewhere + + + + Solution + + +
+
+ + +
+ +
+ Where is the White Rabbit? (Runaround) +
+
+ +
+ +
+Callooh Callay, World! (10)
+Sledgehammered (2)
+Campus Art from Z to A (4)
+Marking Territory (9)
+Eggsam (5)
+SAT III (6)
+Stalk Us Maybe (5)
+1! 2! 3! 4! 4649! (7)
+Crosswalks (1)
+Gone with the Wind (1)
+Venntersections (1)
+Kroskuro (3)
+The Revenge of Yuki Nagato Episode 00 (6)
+The Duck Konundrum VI: Now With Way Way Way Way Way Too Much Pepper (7)
+You've Got Some Nerve (2)
+The Circle of Life (4)
+SKI Trees (11)
+WAT? (1)
+Some Nutty Lines (5)
+The Great Collapse (4)
+Saturdy & Sundy (3)
+Hole Wizard (9)
+Crow Facts (1)
+Magic Mushrooms (3)
+Compose Yourself (4)
+Time Flies (4)
+A Mad Cocktail Party (2)
+Thank Heaven for Little Girls (6)
+Modern Cubism Artist (3)
+Let's Meet in the Middle (4)
+A Curious Incidence (2)
+Crossed Wires (4)
+Cruciform Heraldry (2)
+Wandering Stars (4)
+Directions in Writing (1)
+Diplomatic Victory (5)
+Filed Erector (6)
+Indie Audio Productions (6)
+Growth and Fixed Costs (7)
+Glazing Over (1)
+Walk Across Some Dungeons (5)
+Top Shelf (7)
+Family Ties (5)
+Covert Tops (2)
+
+ +
+ + +
+
+ + + + + + + + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0301_MIT_Mystery_Hunt_2016_Roller_Coaster/_solution_assets/face1.png b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0301_MIT_Mystery_Hunt_2016_Roller_Coaster/_solution_assets/face1.png new file mode 100644 index 0000000000000000000000000000000000000000..78de96de1f3f2bdca5361a7a3521312a94eea159 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0301_MIT_Mystery_Hunt_2016_Roller_Coaster/_solution_assets/face1.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:96c0dab04841ecedd9a99441f9ea62f1fa80f911f02f2f82d1ef4ad2d6cbc2e6 +size 3135 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0304_MIT_Mystery_Hunt_2016_Trubled_Monicas/5e.png b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0304_MIT_Mystery_Hunt_2016_Trubled_Monicas/5e.png new file mode 100644 index 0000000000000000000000000000000000000000..abcf3558f594a694e21c2ab42adf9791fcf41792 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0304_MIT_Mystery_Hunt_2016_Trubled_Monicas/5e.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:25bebc11bd7dfbf8cbcca6c461038ff4dcdadc959cb6be7e0b7b8d364788104e +size 3105 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0306_MIT_Mystery_Hunt_2016_The_Fire_Swamp/_solution_assets/4x4.png b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0306_MIT_Mystery_Hunt_2016_The_Fire_Swamp/_solution_assets/4x4.png new file mode 100644 index 0000000000000000000000000000000000000000..815c2159d93e5119391d1267917cba4d9cbf32ca --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r0306_MIT_Mystery_Hunt_2016_The_Fire_Swamp/_solution_assets/4x4.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b107afdb43fd789a8b81e800788e964ed61dfb780ec810679465c8cbd3db1dc0 +size 3202 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r108_MIT_Mystery_Hunt_2016_All_History_is_Local/event11.gif b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r108_MIT_Mystery_Hunt_2016_All_History_is_Local/event11.gif new file mode 100644 index 0000000000000000000000000000000000000000..36e441edaa15eafbb9ca7194c42a4920e3ef1877 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2016/mit2016r108_MIT_Mystery_Hunt_2016_All_History_is_Local/event11.gif @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4866383dcf46dab55c6a2785fd0b224c9d47b11b01311b69084c66bcdcc507a1 +size 3218 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/2017/mit2017r08m_MIT_Mystery_Hunt_2017_The_Dismal_Dungeon/dungeon-tile.png b/benchmark/MIT_Mystery_Hunt/puzzles/2017/mit2017r08m_MIT_Mystery_Hunt_2017_The_Dismal_Dungeon/dungeon-tile.png new file mode 100644 index 0000000000000000000000000000000000000000..89cdcee72f53781f64e63cacf319218a4bc93c59 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/2017/mit2017r08m_MIT_Mystery_Hunt_2017_The_Dismal_Dungeon/dungeon-tile.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7bdc31103049ef26cbea31448b9df27ce2a7b343d9ddd3586c7563c4cacbe50a +size 3159