diff --git a/benchmark/IOAI/IOAI-2025/At-Home-Round/Radar/validation_set/357.mat.pt b/benchmark/IOAI/IOAI-2025/At-Home-Round/Radar/validation_set/357.mat.pt new file mode 100644 index 0000000000000000000000000000000000000000..71147dbd6191ae270c01d1064ff9f34fbd867bf8 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/At-Home-Round/Radar/validation_set/357.mat.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a5c9fc34165458da31418cf01e8febeccb0d1ea20e2b11bbbee800285789f49b +size 507932 diff --git a/benchmark/IOAI/IOAI-2025/At-Home-Round/Radar/validation_set/359.mat.pt b/benchmark/IOAI/IOAI-2025/At-Home-Round/Radar/validation_set/359.mat.pt new file mode 100644 index 0000000000000000000000000000000000000000..0d963225ef651faa43e1195d64e6fcaf652eabef --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/At-Home-Round/Radar/validation_set/359.mat.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cc79c016a9d8be282f44d488bf8c4fe5a396a1d63dea939dd2da17d3ec539737 +size 507932 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1694072_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1694072_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..d4f6ba8011d1ef3fc441e24bba24806690f2a32d --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1694072_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3214f81418565ae89bf63632777595dd70f4efe026135a22132e68b6a7312dbd +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1910495_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1910495_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..4fefaf118e9e17fdc82aa2549b4cdaf8f90a70f8 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1910495_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9b7d959471b8bece903fb35bb73b5c2545c64e3e26f0b902bdfc6d77f4dc1c14 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1910725_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1910725_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..4d2f72d18bc00fe56ebf96aab80c9368e4e601ca --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1910725_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1e878c8bd43a3fc49f07007007df74e71e2390b3285fc58e4c7675f7d7286883 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914145_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914145_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..8f831746a32d6378d0281530c9bca2f3c781f1a1 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914145_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bb1cd52ff8b1a4005e2968d120ed30fd2007090f8f5ceba7f2003c906dbfea5f +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914600_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914600_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..d403ef38a8897bcd3c6a51a35946f49980fd3157 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914600_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7c1fd04f7365abfc3a656fd9a802db25e1e8667e1bc3c3228c965d09a10287fd +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914865_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914865_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..2663f6d6c19f683e66e449a092c25bae123fb8e2 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1914865_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ddf12bdb6faaca2d637cd810827611ca1797179cc18cba776cee2aecaebb6ec0 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1921207_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1921207_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..a753f91353bdc53f67a3d5bc59eae9d2c27742f9 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1921207_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9a53de1b57b34c30dd9d53c6f1f72d76b29d74f06b49560f742b92731f18cdcf +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1921321_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1921321_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..f5db72374fa0f3cafc43d3c9686524bcd869ae42 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1921321_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c8a60fab36c481dd4448dc16816ece308a82f50004c4c3a1ba512473369646b1 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1922698_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1922698_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..d28cce75e1bb5273443f708535e2c0f4df6a853d --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1922698_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dce59d501e2ef0825ab5b3aaa40738b351185eb686fc844c42f2fa5ec81cc877 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1924286_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1924286_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..7adbb6f5c5bf110b2cbeae50b72b630b8b50dace --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1924286_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f7fbefa9caefec83fb678ed0bd36a1db171994f74b411024302c53c649494321 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1926069_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1926069_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..756f62b1c3823bcf3e8147a3ab72d5019ba6a263 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1926069_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:16d94812ea71667ce295235bced8fa7d70cb1d51ad4981eb5a212cffa32cc33a +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1927778_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1927778_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..29a9f990af72cec8d8441600c55c5dfe8cd0c383 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1927778_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:39dcf5eaa8f298630dc83888fc0449edab6fb538b9a2b901174c5396e1ebc57a +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1929285_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1929285_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..f0c22fc1f5cb5b2dabd4499763639f4e87d4928a --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1929285_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:41c383b36652da7ebeead5b5359c1d1e4058d12223b968c36a380f2b7146439a +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1930201_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1930201_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..7badd698b9fb72d798da779c6898ee4a75a98546 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1930201_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:df74eadb276a5927021f6ef767035818e3f9d939c6d4a7540afc7541fe97fece +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1933882_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1933882_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..fb6a1e5d49f871e0e48062bdd607b31ef9ef91eb --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1933882_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:914ce788e343094d892995c198d6a04887731f5884082039430b129adf1dd4ed +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1934494_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1934494_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..a850b44be8cc46e91447ee9e382c28b95beb84c9 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1934494_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c8a6567974590d9331fc2d709c7cbcf241b74f7a4b62cec8dc81578bee8fd072 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1934834_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1934834_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..5f41ff36f247dff1b01874fa29381d4930d5976c --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1934834_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4ea3f80c31b7e22776df8036ab7c2e175738d5ec04823028a79d8da01124eee9 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1935135_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1935135_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..0e76841df4916e288684aea09dae68ef7804b28a --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1935135_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:364624b26782265ee10ff886dbe3ac5aa8110cee8fe806ebb9541729408efe41 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1938897_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1938897_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..8ec9ba503ad8a87f6726e88a72dfdcf9f468fdca --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1938897_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7e4ea6612bd85bd5419667ea11f6a94c061d95bea09a3e1113e211fb9711dac9 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1939410_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1939410_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..6083b1b659e0a98001f5bf70da1eb459471d29e8 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1939410_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:934cfcb031c7ea697b8f4f0131502f873c6a61e582c16222bf52ec0113a5f428 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1941240_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1941240_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..84c000cfd5dee27fef5f8910192f7ced1bda9c16 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1941240_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:03b04cfcfba0a7c07313c55a1d9ae6cfbf5df495517e37b1a95c465a70255382 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1942975_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1942975_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..e8bb1c4b112dd5980a316a022b16b37425b3ce22 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1942975_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:53f2d99977f9b4d7bae8ff4118b01a63761d6e5443a3e161cd0f2ffab243e00d +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1948520_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1948520_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..233f41b17b59f19c38893d82378db2ab316fb76f --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1948520_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d85750f5ae6238ff1314031bf6fc02a6a09e6e9c310a1eec041bcc1430953d78 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1951792_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1951792_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..f2388de534fb21a5cf2f2fd8c211669812263b2b --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1951792_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2048eb2e9225137ae13b8fa09353ac2f23240c0ccee7b545ef57a7f366d4f16a +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1952207_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1952207_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..f4b8d39b7e286978ad607c5f325caa696bfc43a6 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1952207_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:917bb289b397f36c95718df1d5c8c21530eaba2dcc8c7b198b973c5a916efb09 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1952883_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1952883_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..77474e49d25780b39f86ced1ddeb1532c28d5f4a --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1952883_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4368fe67bc8013c4c28009287fb3d6a30b4d14eb72c4ef9eefa72cba7a800350 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1955285_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1955285_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..dcc35357924b6a3dd473fa607e8af1b57db86c8c --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1955285_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:14b23802e61a717a9a8e4eda2f66a10d06801cd5954908fd5594912dadcf92ee +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1955851_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1955851_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..cb28ed90a683755ccff1a27b2c33828db9676cad --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1955851_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:61c9c46b272b39edd8b0faa92b19dda9576dc09e1912ffb4ae520f631398d620 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1956140_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1956140_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..a2b21819c3a50731c384ddfe80f76a4c7965849c --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1956140_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:25a977df827b736b317a69df8c5ff45787a8ec3097a4851f7b9eb344fcfa98fe +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957306_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957306_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..2ac4ffb9eec8ea2f5a2b562b76b292afb6a42aed --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957306_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2d34ce99d323a1cb604e097ecd68913cf53f8428ba7ad8ca38499c7e265e2154 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957834_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957834_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..d345ac7ac99105d67317152fed0c52d05b2e2d22 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957834_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3d1dad2d0f403d555b89bd44eb59979dbda6005fb590af13ea62d945a9a6422c +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957903_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957903_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..43ff6b8475acd0e0dd37e3799c04e40ca6a0ffc1 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1957903_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f0d8ad476a526940dd8ca25333bcf4e3f61c2f9ead15430cdd363ef0da5a8c2b +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1960467_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1960467_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..1204662ab348d18e4aa375a575dc178158ef7578 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1960467_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e20a7d05c2b425b4c1db40d65b513e313e0af904e2cafffaa5efd21444546a47 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1960904_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1960904_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..fef0fc9014d001608065e6289b19aa37c72645d2 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1960904_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3fdab8c251d449a048aca2a877c0fc3bc5df73e1fbdd38a3e41176e7ec241290 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1962518_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1962518_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..51ec34c03d60e0ee0293a3e43a5ea4e888ec5578 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1962518_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a404a0ba40a3f29b9a8b5291f3170678dccd59ac33390997788b36e2fb26324d +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1965693_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1965693_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..bdaec4e75adc523b3c9ad8dc8770563e5c6b90a8 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1965693_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:35cea28c5767f1e5860fb4826de5655dd1289921519d38ec3007c086d3cfeff3 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1966912_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1966912_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..8dc1edb545ba977231dd6595d18d19824bd616c4 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1966912_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:43b7c8c4ad17b65c5b521b8ff74387a84fc29b86887edb4c314d03e070cfb12d +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967135_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967135_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..f26dd8ec26d4dbe365b98a1902946f4f2e42c632 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967135_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:af052aae48a665e9eb83164cbf8cdfdbf06996c5f53a14905a1ed22327a89b09 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967139_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967139_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..7283914d070461cefcadffbf37254b7d1acd88e8 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967139_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:be7e36b124b2eb3ceb78393b08e7ddb3c07fe36fe8732c12a65ae053ef1f1b50 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967774_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967774_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..b44b70204c4f998230ea81f98c99643ce9dde473 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1967774_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:28e85b68d4b2f32cb326633408e98ec5909cc6bdc6caade7efaae4df770dc6f3 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1970389_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1970389_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..9f0cf654ccb7f170a4c09b101208a58cc67570f8 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1970389_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:576668376fc274870788825449d176792b95ed04951d3fb20b0a4a341246da0c +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1971612_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1971612_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..df565d88ea4258482a292dd88d1ccb3d700df652 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1971612_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d483d2a8498b0e7deaf4d7ade5e36b1ece75e00082e7d5f873b04c12617694c1 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1973613_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1973613_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..82b9a9decd130e6314b3b0bbaad8ae61f1791b75 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1973613_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f91b81ea7cac6db9b21eb5bd0522a31eee2416b039702638703a2804fa88160e +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1977950_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1977950_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..d07557dc94cd8fa80077760c3db97a7570c160f9 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1977950_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d00e8496dd947ee43e0cbf6fcbaeb76c2b21635255bbb394e7a53536205b1681 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1978236_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1978236_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..2d695efd896f3cdb05806e053b3c95c702ff876b --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1978236_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6da3cf8a0fac685d7ec74db3ecd66f57c00cf6b7f110c4d0f41982ce34a430c6 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1978797_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1978797_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..c2f810be0b09cb7632df18d2a446add808087fc2 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1978797_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3affd739da279188aaeac0d10918a27f63e24427e3eada684625a1448adb6468 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1979075_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1979075_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..d2d39a5badcec93ea44576767efcec7a5384144a --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1979075_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:48ad23ae5daad32c69a24d15cf3c689706b11614e92f06f1e71108caf6fe31f6 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1979651_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1979651_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..dd69076f6135966c327fcf2c7ed8366f97c569b1 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1979651_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c34f292e0389ec42b6b1bca2a2b386f84d611b310e90bfd89895a708c994a484 +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1980774_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1980774_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..df9ea4c7a4b44848f529fb4d290f7ea281d0a533 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1980774_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:69db9f06388c2b8f571802065d46dd4e00ec9c561920cfd8e5919e5cf7e5111c +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1983133_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1983133_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..59b0eb59b589856c5314af9e66d103b33116492b --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1983133_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:eee6c4f5f8740ca05f3e81b580d69313981e7c2dbadb07adcdf6be8719c7372b +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1984093_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1984093_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..094dde9ad9057ac83895dd7f9ed2c333a8891176 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1984093_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:856fe1b48dbe6a0be9ad39809400b7ed53ddcd5efde1e20ede8123a56035fb3e +size 49378 diff --git a/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1992754_bonafide.pt b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1992754_bonafide.pt new file mode 100644 index 0000000000000000000000000000000000000000..5cc8999c50a5400240787a499977f22e32bda659 --- /dev/null +++ b/benchmark/IOAI/IOAI-2025/GAITE-Contest/Synthetic_Speech_Detector/training_set/bonafide/LA_E_1992754_bonafide.pt @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f3d7f8d590cb6c7e2ca65435e2b664762feaa0694ac84901cc6e63e5c74a1dee +size 49378 diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round1_12_Puzzle.html/Puzzle.html b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round1_12_Puzzle.html/Puzzle.html new file mode 100644 index 0000000000000000000000000000000000000000..e38604908a4753e8633332274a6798e791f856aa --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round1_12_Puzzle.html/Puzzle.html @@ -0,0 +1,139 @@ + + +
+| + + +Round 1 + + | +
+
+
+
+
+
+ |
+ + 2002 MIT Mystery Hunt + |
+ +"While going through Uncle Pennybag's closet, I realized just how bad +his taste in clothing was. Additionally, the rank odor of the +mothballs was so strong I began to list to one side. However, I still +think the polyester was a greater assault on my senses; I didn't even +know that plaid came as a pink and green combo. Hanging in this +closet is a picture of him in Bermuda shorts but his socks are black! +Well, I'd bring all of this stuff to Goodwill, but this stuff was +never in style, retro or not." + ++ + +This angel eventually splits from the "Fall Guy" causing a major earthquake.
+ +This author and "Poseidon Adventure" veteran used her hands to swim the others to safety against anything that ship had to offer.
+ +It is likely that Mr. Cugat spent some time up front in a rumbleseat with this tacky "Love Boat" regular.
+ +Mallory just didn't get any satisfaction and was painfully and unmercifully lambasted in the press.
+ +This former bath house singer found a second career but kept the wind beneath her wings from becoming a hurricane.
+ +I could have rounded her husbands to a perfect 10, but this plump actress got her husbands and Oscar to have the number 8.
+ +If only the tornado had landed a house on this Oscar-nominated (ha!) +talentless sister of Meg just leaving behind her heels.
+ +If you look at the cavalcade of sitcom starts, not since Patty Duke has an actress played twins like this friend.
+ +Many men wanted to be shipwrecked with this cruise director, but not even the tugboat could steer her from the coke.
+ +Whether as Phyllis or shopping with the girls from the "Facts of Life," this simple actress will always be Lafarge to me.
+ +This actress never mentally recovered from the theft of one husband by Cleopatra; however, without her, we simply wouldn't have had Leia.
+ +This sappy and overdone Mormon has had many husbands (which is not very good), and hopefully the opportunities for her on daytime TV will dry up.
+ +This lady who liked the philosophy of Aristotle was never put out by the pants of the white house pets.
+ +Was it fair that that Blue Moon detective eventually parted from this pregnant cover lady for Vanity Fair?
+ +With a nice Reynolds wrap from her now enemy, you could help this "Nurses" star overcome gravity in the worst way.
+ +Robin Wright has caused a fright and replaced this glitzy girl in Spicoli's life.
+ +Make room for this daughter whose hubby had Halloween-like freaks on his show every day for 20 plus years.
+ +Blake Edwards never rejected this girl who supposedly did novel things under the cover of dark.
+ +Any period of time with this angelic ogre would make me click my heels +together.
+ +We can wonder if Anne's lack of talent and same gender drew her to this icon and bender of rules (whose movies all bore me).
+ +Isabella's mommy must have loaned her those pretty features, but oh brother, did she really deserve an Oscar for that train movie?
+ +She was a perfect compliment to Fred Gwynne plus she didn't have to clean a window or fluff a couch in that house.
+ +This hawker of wares was hit by a flood of orders because of her popularity (plus her good looks made "Step by Step" a hit).
+ +Out of the blue lagoon, it would be a treat to play a trick on this Princeton girl.
+ +Well, maybe someday Texaco Star Theater will drag out a brassiere or some old reruns before we rear and cry "Uncle!"
+ + "The Chad" has had irreconcilable differences because he could not + please nor change his love for this lady.
+ +She must fancy music because of Andre and Frank, but she has to protect her 12-year-old adoptees.
+ +Count Rugen's lady could get a nice pin at a shop for Halloween.
+ +This clerk marked down all the information about the stand-up philosopher, but did she serve leftovers when she was a babysitter on "Malcolm in the Middle?"
+ +This lady runs through the London fog to take her morning train.
+ +I remember her dark hair and complexion before this former Laker girl began doing all her MTV dances.
+ +Now that she's around, Brad doesn't have the chance to snore but he gets to show up on "Friends" in fashion.
+ +This matronly chanteuse didn't choke on a chicken bone, nor a hotdog from Oscar Meyer neither.
+ +In the aftermath of the 1980's, it looks like we can reflect and say, "She's so unusual."
+ +This veteran of "Laugh-In" hasn't yet given the finger to Hollywood, but she may soon be passed by her almost famous daughter.
+ +Catholics had a nightmare when this singer tore up a picture of the Pope and started a new problem for "SNL."
+ +It is a tragedy that this playboy model (groan) is the least talented of the most powerful family of the MTV set.
+ +I could be a little bit kind, but this Vineyard regular probably thinks this line is about her.
+ +Well, Clint need not reject any more women from his old harem now that he has this former soap star.
+ +She's still trying to keep her career going after all these years, but "Spin City" gave her a lift as Paul's hot mom.
+ +The pairing of this down-and-out singer with Derek Jeter was laughably wrong, but this doll has other problems now.
+ + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round1_12_Puzzle.html/checkanswer.js b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round1_12_Puzzle.html/checkanswer.js new file mode 100644 index 0000000000000000000000000000000000000000..cc5741feb1f623cca1b1cf7c57a0777a0c66117b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round1_12_Puzzle.html/checkanswer.js @@ -0,0 +1,281 @@ +// Do this first so that layout shift isn't too bad: +const container = document.createElement("div"); +container.style = ` + font-size: 16px; + font-size: clamp(16px, 2.4vw, 21px); + height: 2.5em; +`; +document.body.prepend(container); + +import { React, html, css, render } from "./package.js"; + +/** + * Remove non-alphanumeric characters. + */ +const normalizeAnswer = (answer) => { + if (getYear() === 2003) { + if (document.URL.includes("teamGuest/2")) { + // Special case: 2003 R2, whose answers are emoji. + return answer.trim(); + } else if (document.URL.includes("6_3")) { + // Special case: Answer is literal Greek letter. + return answer.trim(); + } + } + return answer.toUpperCase().replaceAll(/[^A-Z0-9]/g, ""); +}; + +/** + * Returns the year of the hunt we're in. + */ +const getYear = () => { + return Number(RegExp(`^.*/([0-9]{4})/.*$`).exec(document.URL)?.[1] ?? 0); +}; + +/** + * Fetches the answers as a list of {url, answer, prompt, intermediate}. + */ +const getData = async () => { + const res = await fetch("/answers.tsv"); + const data = await res.text(); + const [header, ...body] = data.split("\n"); + const headers = header.trim().split("\t"); + return body.map((row) => { + const res = {}; + row.split("\t").forEach((item, i) => { + res[headers[i]] = item.trim(); + }); + return res; + }); +}; + +/** + * Gets the base URL; removes trailing index.html and .html, removes everything + * before the year, and then removes trailing slash. + */ +const getBase = (url) => { + const root = + RegExp(`^(.*/)index.html`).exec(url)?.[1] ?? + RegExp(`^(.*).html`).exec(url)?.[1] ?? + url; + const base = RegExp(`^.*/([0-9]{4}/.*)$`).exec(root)?.[1] ?? root; + return base.endsWith("/") ? base.slice(0, -1) : base; +}; + +/** + * Get all rows in the data corresponding to a given URL. Group by same prompt. + */ +const getAnswers = (data, url) => { + const base = getBase(url); + const rows = data.filter((row) => getBase(row.url) === base); + const prompts = []; + for (const row of rows) { + const { prompt } = row; + const group = prompts.find((group) => group.prompt === prompt); + if (group) { + group.rows.push(row); + } else { + prompts.push({ prompt, rows: [row] }); + } + } + return prompts; +}; + +/** + * A single textbox and submit button in the rows of possible responses. + */ +const ResponseRow = ({ prompt, rows, setFeedback }) => { + const [response, setResponse] = React.useState(""); + + const form = css` + align-items: baseline; + display: flex; + justify-content: right; + margin-bottom: 0.5em; + + @media (max-width: 600px) { + align-items: flex-start; + flex-direction: column; + } + `; + + const input = css` + background: #fafafa; + border: 1px solid #aaa; + border-radius: 2px; + color: #121212; + font-family: inherit; + font-size: 100%; + line-height: 1.2; + margin: 0 0.5em; + padding: 0.25em 0.5em; + + @media (max-width: 600px) { + margin: 0 0 0.25em; + } + `; + + const onSubmit = (e) => { + e.preventDefault(); + let set = false; + for (const row of rows) { + const correct = normalizeAnswer(row.answer) === normalizeAnswer(response); + if (correct) { + setFeedback( + row.intermediate?.trim() === "TRUE" + ? "Correct! See the solution page for the answer." + : `Solved! The answer was ${row.answer}.` + ); + set = true; + break; + } + } + if (!set) { + setFeedback("Incorrect."); + } + }; + + const onChange = (e) => setResponse(e.target.value); + + return html` +
+ `; +}; + +/** + * Check answer button, rendered at top of page. + */ +const CheckButton = ({ prompts }) => { + const [open, setOpen] = React.useState(false); + const [feedback, setFeedback] = React.useState("Call in an answer."); + + const wrapper = css` + font-family: "PT Sans", sans-serif; + font-size: 16px; + font-size: clamp(16px, 2.4vw, 21px); + height: 2.5em; + + button { + background: #555; + border: none; + border-radius: 2px; + color: #fff; + cursor: pointer; + display: inline-block; + font-size: 1em; + font-family: "PT Sans", sans-serif; + font-weight: bold; + line-height: 1.2; + padding: 0.25em 1em; + text-align: center; + text-decoration: none; + text-transform: none; + } + + p { + margin: 0 0 1em; + } + + a { + color: inherit !important; + } + `; + + const btnTop = [2015, 2016].includes(getYear()) + ? "50px" + : [2012].includes(getYear()) + ? "-2.5em" + : "0px"; + + const button = css` + box-sizing: border-box; + height: 2.5em; + left: 0; + position: absolute; + top: ${btnTop}; + width: 100%; + z-index: 9999; + `; + + const dropdownWrapper = css` + background: #edeff0; + color: #121212; + left: 0; + position: absolute; + right: 0; + top: calc(2.5em + ${btnTop}); + z-index: 9999; + `; + + const dropdown = css` + margin: 0 auto; + max-width: 40em; + padding: 1em; + z-index: 9999; + `; + + const responses = css` + margin: 0 auto; + width: fit-content; + + @media (max-width: 600px) { + width: auto; + } + `; + + const onClick = () => setOpen(!open); + + const body = + prompts.length > 0 + ? prompts.map( + (group) => + html`<${ResponseRow} setFeedback=${setFeedback} ...${group} />` + ) + : html`+ No answers found on this page. Please report this to${" "} + puzzle@mit.edu. +
`; + + return html` + +${feedback}
+| + + +Round 1 + + | ++ 2002 MIT Mystery Hunt + |
+
- MINOR INCONSISTENCIES (solution)
+
- DRIVE-TIME SHIFT (solution)
+
- PENNYBAGS LIVES! (solution)
+
- SHARE AND SHARE ALIKE (solution)
+
- PILES OF HEXAGONS (solution)
+
- VARIATIONS ON A THEME (solution)
+
- VIAL ODORS (solution)
+
- I WANT MY MYSTERY HUNT PUZZLE! (solution)
+ + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_02_Puzzle.html/Puzzle.html b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_02_Puzzle.html/Puzzle.html new file mode 100644 index 0000000000000000000000000000000000000000..a5e2104c2c41c55436c446177cd19d9e6bd1a455 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_02_Puzzle.html/Puzzle.html @@ -0,0 +1,104 @@ + + +
+| + + +Round 2 + + | +
+
+
+
+
+
+ |
+ + 2002 MIT Mystery Hunt + |
+ +Attached to the deed is a copy of your favorite bedtime story! + ++ +It was a dark and stormy night in London. Cumulonimbus clouds drifted +across the sky. A flying creature ricocheted off the decaying walls. +Miranda stepped out of the tavern, sipping at her earthen mug. Gulls +circled in the air, all shrieking above the noise of the storm. A +solitary raven clawed at the sign hanging above the pub. + +Suddenly, Miranda dropped her mug and shrieked. In front of her, an +olive and ermine portal opened and a hideous creature emerged. She +stumbled back blindly and ran headlong.
+ +"Bottoms up!" James toasted his friend Sirius's recent successes at +work. James cocked up his ears. "Did you hear that?" he asked his +friend Sirius. Sirius nodded - "I heard a 'owl! 'Urry!" They dashed out of +the pub and skidded around the corner to see Miranda and the beast.
+ +James struck a pose as a dashing ranger. "Fear not, fair maid! I +study kung fu, you know."
+ +Hooting with nervous laughter, Miranda pointed at the monster, while +Sirius taunted the beast: "Run back to your nanny-anny! May justice +prevail here!"
+ +The odd creature finally spoke. "Treat your adversaries with honor - +Bertrand Russell, logician, would reject your uncouth taunts as +unworthy of a proper opponent."
+ +Sirius rejected such calls to the rational powers. "Vile pachyderm! +Strangle yourself on your own stinkin' words!" Just then an unearthly +music drifted from the portal. Miranda gasped, "A chilling riff! In +door!" James said, "What other unclean creatures are you summoning, +fiend? We shall riddle your corpses with our harsh blows!"
+ +The beast drew himself up to his full height of three meters and +sighed. "I should have known better than to expect an Englishman to +play fair. Never ask a bandit for a favor, the philosophers say." He +gestured at the ground, mumbled, and it shook with tremors.
+ +"More damnation from you, brute? We are agog with the desire to +defeat you!" James cried.
+ +Miranda, now fully recovered, said, "Why aren't you answerin' his +challenge like gentlemen?" "Ah, you're envisioning some dignified +duel, on a tree lawn? 'E's not worth the respect," replied Sirius. +Miranda was not convinced. "You're looking forward to the goblin's +end? 'E owns you right now! While you crouch with your little +taunts, 'e's provin' his manly superiority!"
+ +James sneered at Miranda, "Get a grip, eh?" He turned towards the +beast, finally ready to pounce, when suddenly the monster conjured a +hex spell - "Eeeeeee-yah!" -- or musters a curse, and he and Sirius +flew backwards, smacking the walls.
+ +Miranda, without a look backwards, offered her arm to the monster. +"You're actually a charmin' gargoyle, on further acquaintance." They +waltzed back through the portal as Tchaikovsky's "Romeo and Juliet +Overture" drifts through the background. And they lived happily ever +after.
+ + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_02_Puzzle.html/checkanswer.js b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_02_Puzzle.html/checkanswer.js new file mode 100644 index 0000000000000000000000000000000000000000..cc5741feb1f623cca1b1cf7c57a0777a0c66117b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_02_Puzzle.html/checkanswer.js @@ -0,0 +1,281 @@ +// Do this first so that layout shift isn't too bad: +const container = document.createElement("div"); +container.style = ` + font-size: 16px; + font-size: clamp(16px, 2.4vw, 21px); + height: 2.5em; +`; +document.body.prepend(container); + +import { React, html, css, render } from "./package.js"; + +/** + * Remove non-alphanumeric characters. + */ +const normalizeAnswer = (answer) => { + if (getYear() === 2003) { + if (document.URL.includes("teamGuest/2")) { + // Special case: 2003 R2, whose answers are emoji. + return answer.trim(); + } else if (document.URL.includes("6_3")) { + // Special case: Answer is literal Greek letter. + return answer.trim(); + } + } + return answer.toUpperCase().replaceAll(/[^A-Z0-9]/g, ""); +}; + +/** + * Returns the year of the hunt we're in. + */ +const getYear = () => { + return Number(RegExp(`^.*/([0-9]{4})/.*$`).exec(document.URL)?.[1] ?? 0); +}; + +/** + * Fetches the answers as a list of {url, answer, prompt, intermediate}. + */ +const getData = async () => { + const res = await fetch("/answers.tsv"); + const data = await res.text(); + const [header, ...body] = data.split("\n"); + const headers = header.trim().split("\t"); + return body.map((row) => { + const res = {}; + row.split("\t").forEach((item, i) => { + res[headers[i]] = item.trim(); + }); + return res; + }); +}; + +/** + * Gets the base URL; removes trailing index.html and .html, removes everything + * before the year, and then removes trailing slash. + */ +const getBase = (url) => { + const root = + RegExp(`^(.*/)index.html`).exec(url)?.[1] ?? + RegExp(`^(.*).html`).exec(url)?.[1] ?? + url; + const base = RegExp(`^.*/([0-9]{4}/.*)$`).exec(root)?.[1] ?? root; + return base.endsWith("/") ? base.slice(0, -1) : base; +}; + +/** + * Get all rows in the data corresponding to a given URL. Group by same prompt. + */ +const getAnswers = (data, url) => { + const base = getBase(url); + const rows = data.filter((row) => getBase(row.url) === base); + const prompts = []; + for (const row of rows) { + const { prompt } = row; + const group = prompts.find((group) => group.prompt === prompt); + if (group) { + group.rows.push(row); + } else { + prompts.push({ prompt, rows: [row] }); + } + } + return prompts; +}; + +/** + * A single textbox and submit button in the rows of possible responses. + */ +const ResponseRow = ({ prompt, rows, setFeedback }) => { + const [response, setResponse] = React.useState(""); + + const form = css` + align-items: baseline; + display: flex; + justify-content: right; + margin-bottom: 0.5em; + + @media (max-width: 600px) { + align-items: flex-start; + flex-direction: column; + } + `; + + const input = css` + background: #fafafa; + border: 1px solid #aaa; + border-radius: 2px; + color: #121212; + font-family: inherit; + font-size: 100%; + line-height: 1.2; + margin: 0 0.5em; + padding: 0.25em 0.5em; + + @media (max-width: 600px) { + margin: 0 0 0.25em; + } + `; + + const onSubmit = (e) => { + e.preventDefault(); + let set = false; + for (const row of rows) { + const correct = normalizeAnswer(row.answer) === normalizeAnswer(response); + if (correct) { + setFeedback( + row.intermediate?.trim() === "TRUE" + ? "Correct! See the solution page for the answer." + : `Solved! The answer was ${row.answer}.` + ); + set = true; + break; + } + } + if (!set) { + setFeedback("Incorrect."); + } + }; + + const onChange = (e) => setResponse(e.target.value); + + return html` +
+ `; +}; + +/** + * Check answer button, rendered at top of page. + */ +const CheckButton = ({ prompts }) => { + const [open, setOpen] = React.useState(false); + const [feedback, setFeedback] = React.useState("Call in an answer."); + + const wrapper = css` + font-family: "PT Sans", sans-serif; + font-size: 16px; + font-size: clamp(16px, 2.4vw, 21px); + height: 2.5em; + + button { + background: #555; + border: none; + border-radius: 2px; + color: #fff; + cursor: pointer; + display: inline-block; + font-size: 1em; + font-family: "PT Sans", sans-serif; + font-weight: bold; + line-height: 1.2; + padding: 0.25em 1em; + text-align: center; + text-decoration: none; + text-transform: none; + } + + p { + margin: 0 0 1em; + } + + a { + color: inherit !important; + } + `; + + const btnTop = [2015, 2016].includes(getYear()) + ? "50px" + : [2012].includes(getYear()) + ? "-2.5em" + : "0px"; + + const button = css` + box-sizing: border-box; + height: 2.5em; + left: 0; + position: absolute; + top: ${btnTop}; + width: 100%; + z-index: 9999; + `; + + const dropdownWrapper = css` + background: #edeff0; + color: #121212; + left: 0; + position: absolute; + right: 0; + top: calc(2.5em + ${btnTop}); + z-index: 9999; + `; + + const dropdown = css` + margin: 0 auto; + max-width: 40em; + padding: 1em; + z-index: 9999; + `; + + const responses = css` + margin: 0 auto; + width: fit-content; + + @media (max-width: 600px) { + width: auto; + } + `; + + const onClick = () => setOpen(!open); + + const body = + prompts.length > 0 + ? prompts.map( + (group) => + html`<${ResponseRow} setFeedback=${setFeedback} ...${group} />` + ) + : html`+ No answers found on this page. Please report this to${" "} + puzzle@mit.edu. +
`; + + return html` + +${feedback}
+| + + +Round 2 + + | ++ 2002 MIT Mystery Hunt + |
+
- D2: THE MIGHTY DUCK KONUNDRUM (solution)
+
- USE OF GOTHICISM CONSIDERED HARMFUL (solution)
+
- FIGHT CLUB (solution)
+
- HOW TO BE A MILLIONAIRE (solution)
+ + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_03_Puzzle.html/Puzzle.html b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_03_Puzzle.html/Puzzle.html new file mode 100644 index 0000000000000000000000000000000000000000..9b9c15c84992e5e6246664d1c6e278f8de2740a6 --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_03_Puzzle.html/Puzzle.html @@ -0,0 +1,68 @@ + + +
+| + + +Round 2 + + | +
+
+
+
+
+
+ |
+ + 2002 MIT Mystery Hunt + |
+ + + +Uncle Pennybags wasn't just a famous industrialist. He was also a +real nature lover. + ++ +
, 760, 757(18), 756(5),
+755(24), 753(13), 752(19), 751(1), 750(10), 747(10), 746(11), 742(5),
+741(13), 740(19), 739(19), 738(10), 737(9), 709(18), 706, 704(11),
+702(7), 699(27), 698, 697, 694, 695, 693, 692, 689, 687(16), 658(21),
+660(22), 661(18), 664, 666(15), 668(20), 669(9), 670, 671, 673, 674,
+683, 682, 681, 680(11), 679(9), 1613(21), 1614, 1615, 1616, 1617, 629,
+631, 627, 633(11), 625(18), 635, 623, 637, 622, 620, 621, 608, 607,
+603, 602, 599(11), 598(10), 597(16), 594(2), 593, 579, 578, 577(16), 576,
+590, 589, 588, 573, 572, 571, 570(11), 586(30), 585(6), 588, 584, 583,
+582, 581(26), 580(24), 566(2), 1690, 1689,
, 1730, 1734, 1735, 1737(11), 1744(24), 1742(24),
+1743(24), 1739(29), 1752, 1754, 1756, 1759, 1762, 1763, 1764, 1768,
+1767, 1766(17), 1716(24), 1715, 1717, 1714, 1713, 1711, 1710, 1709,
+1699, 1700, 1698(11), 1697(2), 1696(2), 1695(25),
,
+1644(29),
, 1638(20), 1637,
+1636, 1629, 1628(16), 1627(19), 1626(25), 1621(28), 1620(28), 1619,
+1618, 1630, 1634, 1635
+
+
+
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_03_Puzzle.html/checkanswer.js b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_03_Puzzle.html/checkanswer.js
new file mode 100644
index 0000000000000000000000000000000000000000..cc5741feb1f623cca1b1cf7c57a0777a0c66117b
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_03_Puzzle.html/checkanswer.js
@@ -0,0 +1,281 @@
+// Do this first so that layout shift isn't too bad:
+const container = document.createElement("div");
+container.style = `
+ font-size: 16px;
+ font-size: clamp(16px, 2.4vw, 21px);
+ height: 2.5em;
+`;
+document.body.prepend(container);
+
+import { React, html, css, render } from "./package.js";
+
+/**
+ * Remove non-alphanumeric characters.
+ */
+const normalizeAnswer = (answer) => {
+ if (getYear() === 2003) {
+ if (document.URL.includes("teamGuest/2")) {
+ // Special case: 2003 R2, whose answers are emoji.
+ return answer.trim();
+ } else if (document.URL.includes("6_3")) {
+ // Special case: Answer is literal Greek letter.
+ return answer.trim();
+ }
+ }
+ return answer.toUpperCase().replaceAll(/[^A-Z0-9]/g, "");
+};
+
+/**
+ * Returns the year of the hunt we're in.
+ */
+const getYear = () => {
+ return Number(RegExp(`^.*/([0-9]{4})/.*$`).exec(document.URL)?.[1] ?? 0);
+};
+
+/**
+ * Fetches the answers as a list of {url, answer, prompt, intermediate}.
+ */
+const getData = async () => {
+ const res = await fetch("/answers.tsv");
+ const data = await res.text();
+ const [header, ...body] = data.split("\n");
+ const headers = header.trim().split("\t");
+ return body.map((row) => {
+ const res = {};
+ row.split("\t").forEach((item, i) => {
+ res[headers[i]] = item.trim();
+ });
+ return res;
+ });
+};
+
+/**
+ * Gets the base URL; removes trailing index.html and .html, removes everything
+ * before the year, and then removes trailing slash.
+ */
+const getBase = (url) => {
+ const root =
+ RegExp(`^(.*/)index.html`).exec(url)?.[1] ??
+ RegExp(`^(.*).html`).exec(url)?.[1] ??
+ url;
+ const base = RegExp(`^.*/([0-9]{4}/.*)$`).exec(root)?.[1] ?? root;
+ return base.endsWith("/") ? base.slice(0, -1) : base;
+};
+
+/**
+ * Get all rows in the data corresponding to a given URL. Group by same prompt.
+ */
+const getAnswers = (data, url) => {
+ const base = getBase(url);
+ const rows = data.filter((row) => getBase(row.url) === base);
+ const prompts = [];
+ for (const row of rows) {
+ const { prompt } = row;
+ const group = prompts.find((group) => group.prompt === prompt);
+ if (group) {
+ group.rows.push(row);
+ } else {
+ prompts.push({ prompt, rows: [row] });
+ }
+ }
+ return prompts;
+};
+
+/**
+ * A single textbox and submit button in the rows of possible responses.
+ */
+const ResponseRow = ({ prompt, rows, setFeedback }) => {
+ const [response, setResponse] = React.useState("");
+
+ const form = css`
+ align-items: baseline;
+ display: flex;
+ justify-content: right;
+ margin-bottom: 0.5em;
+
+ @media (max-width: 600px) {
+ align-items: flex-start;
+ flex-direction: column;
+ }
+ `;
+
+ const input = css`
+ background: #fafafa;
+ border: 1px solid #aaa;
+ border-radius: 2px;
+ color: #121212;
+ font-family: inherit;
+ font-size: 100%;
+ line-height: 1.2;
+ margin: 0 0.5em;
+ padding: 0.25em 0.5em;
+
+ @media (max-width: 600px) {
+ margin: 0 0 0.25em;
+ }
+ `;
+
+ const onSubmit = (e) => {
+ e.preventDefault();
+ let set = false;
+ for (const row of rows) {
+ const correct = normalizeAnswer(row.answer) === normalizeAnswer(response);
+ if (correct) {
+ setFeedback(
+ row.intermediate?.trim() === "TRUE"
+ ? "Correct! See the solution page for the answer."
+ : `Solved! The answer was ${row.answer}.`
+ );
+ set = true;
+ break;
+ }
+ }
+ if (!set) {
+ setFeedback("Incorrect.");
+ }
+ };
+
+ const onChange = (e) => setResponse(e.target.value);
+
+ return html`
+
+ `;
+};
+
+/**
+ * Check answer button, rendered at top of page.
+ */
+const CheckButton = ({ prompts }) => {
+ const [open, setOpen] = React.useState(false);
+ const [feedback, setFeedback] = React.useState("Call in an answer.");
+
+ const wrapper = css`
+ font-family: "PT Sans", sans-serif;
+ font-size: 16px;
+ font-size: clamp(16px, 2.4vw, 21px);
+ height: 2.5em;
+
+ button {
+ background: #555;
+ border: none;
+ border-radius: 2px;
+ color: #fff;
+ cursor: pointer;
+ display: inline-block;
+ font-size: 1em;
+ font-family: "PT Sans", sans-serif;
+ font-weight: bold;
+ line-height: 1.2;
+ padding: 0.25em 1em;
+ text-align: center;
+ text-decoration: none;
+ text-transform: none;
+ }
+
+ p {
+ margin: 0 0 1em;
+ }
+
+ a {
+ color: inherit !important;
+ }
+ `;
+
+ const btnTop = [2015, 2016].includes(getYear())
+ ? "50px"
+ : [2012].includes(getYear())
+ ? "-2.5em"
+ : "0px";
+
+ const button = css`
+ box-sizing: border-box;
+ height: 2.5em;
+ left: 0;
+ position: absolute;
+ top: ${btnTop};
+ width: 100%;
+ z-index: 9999;
+ `;
+
+ const dropdownWrapper = css`
+ background: #edeff0;
+ color: #121212;
+ left: 0;
+ position: absolute;
+ right: 0;
+ top: calc(2.5em + ${btnTop});
+ z-index: 9999;
+ `;
+
+ const dropdown = css`
+ margin: 0 auto;
+ max-width: 40em;
+ padding: 1em;
+ z-index: 9999;
+ `;
+
+ const responses = css`
+ margin: 0 auto;
+ width: fit-content;
+
+ @media (max-width: 600px) {
+ width: auto;
+ }
+ `;
+
+ const onClick = () => setOpen(!open);
+
+ const body =
+ prompts.length > 0
+ ? prompts.map(
+ (group) =>
+ html`<${ResponseRow} setFeedback=${setFeedback} ...${group} />`
+ )
+ : html`+ No answers found on this page. Please report this to${" "} + puzzle@mit.edu. +
`; + + return html` + +${feedback}
+| + + +Round 2 + + | ++ 2002 MIT Mystery Hunt + |
+
- D2: THE MIGHTY DUCK KONUNDRUM (solution)
+
- USE OF GOTHICISM CONSIDERED HARMFUL (solution)
+
- FIGHT CLUB (solution)
+
- HOW TO BE A MILLIONAIRE (solution)
+ + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_04_Puzzle.html/Puzzle.html b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_04_Puzzle.html/Puzzle.html new file mode 100644 index 0000000000000000000000000000000000000000..36f1a6c181ab7d7f0f7005705c003e1511df844b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_04_Puzzle.html/Puzzle.html @@ -0,0 +1,406 @@ + + +
+| + + +Round 2 + + | +
+
+
+
+
+
+ |
+ + 2002 MIT Mystery Hunt + |
+ +Ready for seconds? + ++ +Please gather the following board games: Clue (the original American +version), Scrabble, Trivial Pursuit, Chess, and Escape from Zyzzlvaria. +Also assemble five players and a live duck. + +
Each player takes one game and has their own set of directions to follow. +All players should follow each step simultaneously; i.e. don't start Step 2 +until all five players have completed Step 1. Conditionals referring to +other people's boards refer to those boards at the START of the turn. If a +direction tells you to do something that affects someone else's board, wait +and do that at the END of that turn. + +
At the end of each turn (and only at the end), the duck may perform various +actions. The duck will know what to do, but in case you have a defective +duck, we have included an index of standard duck behavior. Feel free to use +it as an aid, but beware; if we find out you're not using a real duck, +we'll call the Duck Police on you and they'll be pissed. + +
Enjoy. Your sanity will miss you. + + +
NOTES: Standard chess notation is used. Directions are from White's +perspective, so "up" is toward the 8th rank, and "right" is toward the +h-file. A piece "threatens" another piece if it can capture the piece in a +single move and the pieces are different colors. Pieces cannot capture +pieces of the same color. + +
1. Set the board up as you would for the start of a normal game. Legally +move each pawn once such that no pawn is on a square that matches its color. + +
2. There are four legal captures on the board if you ignore that "en +passant" crap. Make all four captures. Next, make a legal move with each +knight; if the knight can move to multiple squares, choose the one closest +to h1. + +
3. Remove from the board any piece that is currently threatened by a piece +in the lower left quadrant of the board. Move every piece in the 6th rank +down one space. + +
4. If one white piece is removed, the piece on c1 can move to the 8th rank +in three moves without making any captures. Remove that piece and place it +on f6. Then move the piece on c1 three times to take it to the 8th rank. +Use the piece on h4 to capture the most powerful piece it currently threatens. + +
5. Castle as both black and white, one king-side and one +queen-side. Legally capture a piece that cannot move diagonally with a +rook. Remove every piece that is currently threatened by two pawns. + +
6. Perform all the possible one-move captures by bishops and knights. Move +the white king to any square on the 8th rank horizontally adjacent to two +black pieces. + +
7. Switch the black piece adjacent (orthogonally or diagonally) to two +white pieces and the piece which is next to a piece which is neither black +or white. If the resulting board position (apart from any non-chess pieces +on the board) could occur in a legal game, move all pawns on the board to +the Lounge; otherwise move all knights on the board to the Hall. + +
8. Remove all adjacent pairs of pieces that are the same type (not +necessarily the same color.) Make the only legal move of a black piece to +the 1st rank that you can make without capturing. + +
9. Temporarily treat any non-chess pieces on the board as black knights, if +any of them can capture, they do so. Move each rook on the board up as many +spaces as there are R's on the Scrabble board. + +
10. Move every black rook to the highest rank that contains no pieces, +staying in the same file. If you can make a capture with the white queen, +do so, unless she threatens a non-chess piece. + +
* The 1st letter of the answer is the file of the only white piece that +currently threatens two black pieces. + +
* The 9th letter of the answer is the file of the piece on the board whose +name comes last in alphabetical order. + + +
NOTE: A legal move means that every new word you create with the move is in +the Official Scrabble Players' Dictionary. If an instruction asks whether a +word is "spelled" on the board, it doesn't matter if there are other +letters next to it. For example, if CHATTER is on the board, HAT is +considered to be spelled on the board as well. + +
1. Spell NORTH and SOUTH in the center column, NORTH at the top of the +board, SOUTH at the bottom. Spell WEST and EAST similarly in the center +row. Place an X on the center square. + +
2. Four tiles on the board are between pairs of DLS squares. Place tiles on +each of the eight DLS squares to make four runs of three consecutive +letters, reading left-to-right and/or top-to-bottom. (Treat Z then A as a +consecutive pair.) + +
3. Spell the word TONE using a T already on the board in every place where +this is a legal move. Replace each T that you cannot use in this way with a G. + +
4. Move every letter that is one of the first five in the alphabet one +square down and one to the left. Switch the positions of the two consonants +which are now one square up and one to the left of a TLS square. + +
5. Legally play four of the following words, placing only ten +tiles: AXED, BRAIN, CROWN, SOUP, STAKE, and WASTE. Place a U in every +empty square immediately to the left of an A, unless it is on the left +half of the board. + +
6. Put an I in every empty DLS that is orthogonally adjacent to at +least two tiles. Place an O four spaces to the right and one space up +from the place where you could put an R and complete a 7-letter +word. Put an I in every DLS that is orthogonally adjacent to at least +two tiles. Yes, again. Stop complaining. + +
7. If we consider orthogonally adjacent letters "connected," there are five +"islands" of connected letters. Move the entire 12-tile island up one +square and one square to the right. Move the 1-tile island to the space +above the single tile with the highest point-value. In case of a tie, use +the rightmost tile. + +
8. If the name of a piece from Chess or Trivial Pursuit is on the board, +move that piece to the upper right square of your board. If the name of a +piece from Clue or Escape From Zyzzlvaria is on the board, move that piece +to the lower left square of your board. If in any of these cases you have +to choose a color, pick black or yellow. Play the word FAMKA the only place +it fits without moving tiles or using blanks, no matter how many nonsense +words it creates. + +
9. Note the two tiles on the board with the highest point values that +aren't Q. There are two spaces which are in the same row as one of these +and the same column as the other. One of these spaces has a tile on it; +move this tile to the other space and replace it with a Y (unless there's a +weapon on the board, in which case replace it with a P.) + +
10. Replace every tile with a point value divisible by 4 with an O if the +upper right square of the board is empty, and an E if not. Place the +replaced tiles in the top row in alphabetical order starting from the upper +left corner. + +
* One L on the board is one square up and one square left from an empty +square. The tile three squares to the right and three squares down from +that L is the 6th letter of the answer. + +
* It is impossible to follow these instructions with a standard Scrabble +set without using at least one blank. The letter represented by a blank on +the final board is the 2nd letter of the answer. + + + +
NOTE: Dollarbucks are not considered pieces. Duh. + +
1. Place Harold (the green piece) on the Immunity Zone, Ralph (the orange +piece) and Leah (the blue piece) on the Lazyr Zone, Zoe (the pink piece) on +Sector J, and Captain Blastoid (the metallic piece) on the Core Reactor. + +
2. Put 3 dollarbucks on the same area as each character, unless there are +two characters on an area, in which case place 8 dollarbucks on that area. +Set the Moon Counter to Last Quarter. + +
3. Take every character on the area with the most dollarbucks and move it +to the Astro Jail. If Captain Blastoid is less than five squares away from +Zoe, move a piece which is sharing an area with Harold to Outpost 9; +otherwise, move it to Sector N. + +
4. Move 2 dollarbucks from the area Zoe is on and 3 from the Lazyr Zone to +Sector N. Move all characters on Sector N to Outpost 9. + +
5. Move Ralph to the northernmost area with an even non-zero number of +dollarbucks. If no such area exists, move Captain Blastoid to the +westernmost area which contains a character from another game. Add 4 +dollarbucks on the Core Reactor. + +
6. Put 6 dollarbucks on the Astro Jail. Set the Moon Counter to Eclipse. +Move all characters currently on the Astro Jail to Sector N. Move Zoe to +the same space as Leah. Move Leah one space clockwise for every +dollarbuck on Sector N. + +
7. If the duck has laid an egg, replace Harold with 5 dollarbucks. +Otherwise, switch the positions of Leah and Captain Blastoid. + +
8. If there are more dollarbucks on Sector N than on the Core Reactor, move +Ralph to the Reverse Dimension. Otherwise, add as many dollarbucks on the +Astro Jail as there are bishops on the chessboard. + +
9. If the total number of dollarbucks on the board is odd, move all pieces +on the board to Sector N. If it's even, move all pieces except people to +Sector J. + +
10. Spin the Wheel of Death. If you get a skull, set the Moon Counter to +Neutral; otherwise, remove Harold from the board and pat the duck. + +
* The 5th letter of your answer is the initial letter of the +Zyzzlvarian character on the same area of the board as a chess piece. + +
* The 7th letter of your answer is the Nth letter of the alphabet where N +is the product of the number of dollarbucks on the Astro Jail and the +number of dollarbucks on the area containing a weapon. + +
+ +
NOTE: We will refer to the pies' colors as green, pink, brown, orange, +blue, and yellow. No magenta or nothin'. Never place more than one wedge of +a single color in the same pie. + +
1. Place each pie on the wedge space on the opposite side of the board from +the wedge space matching the color of the pie. + +
2. Move each pie clockwise the same number of spaces as there are letters +in the pie color. If you hit roll again, move that pie the same number of +spaces again. + +
3. For each pie, put in a wedge of each color such that the pie is exactly +five squares away from a space of that color. Two pies now contain wedges +of the same color as the space the pies are on; move each of those pies +to the nearest wedge space and three spaces inward. + +
4. Put the brown pie halfway between where it is now and where the orange +pie is. Put the blue pie halfway between where it is now and where the pink +pie is. + +
5. Move every piece on the board (regardless of what game it's from) to the +closest space to the hub which is the same color as the space the piece is +currently on. If a piece is already on the hub, move it to the wedge space +of the color opposite the color of the piece on a standard color wheel. + +
6. Move each pie (4 - N) spaces, where N is the number of wedges in that +pie, without passing through or landing on the hub or a Roll Again space. +If a pie does not contain the wedge of the color of the space it is now on, +add that wedge. And while you're at it, stick a blue wedge in the yellow pie. + +
7. If the hub is empty, place the piece closest to the brown wedge space on +square b7. If not, place the piece closest to the orange wedge space on g2. + +
8. Move every piece on the board (except for pieces on the hub) nine +spaces; outward if possible, otherwise clockwise if the piece contains +three or more wedges, counterclockwise if it doesn't. Put a green wedge in +every pie that is now on a wedge space. + +
9. Place a yellow wedge in every pie that is one space away from a yellow +space. Switch the two pies on the board that contain the most wedges. If +there is a piece on the hub, switch it with the piece furthest away from +the pink wedge space. + +
10. If the duck has laid an egg, move the brown pie one space clockwise and +remove the pink pie from the board. Otherwise, move the brown pie three +spaces counterclockwise and remove the green pie from the board. + +
* Starting with the pink wedge space as "A" and proceeding +counterclockwise, label the outer ring of the board with consecutive +letters of the alphabet. The 8th letter of the answer is the letter of +the space containing the brown pie. + +
* The 3rd letter of the answer is the letter of the space containing a weapon. + +
NOTE: The center section will be referred to as the Stairway, and is not +considered a room. + +
1. Place each character in a different room, starting from the Conservatory +and proceeding clockwise, in alphabetical order by last name of the actor +who played them in the movie Clue. Of the three empty rooms, place the +Wrench and Gun in the smallest room, the Rope and Knife in the room that +comes first alphabetically, and the Lead Pipe and Candlestick in the third +room. + +
2. Switch the contents of each pair of rooms that are connected by secret +passages. Take the two characters who are of the same gender and who are in +adjacent rooms and move them to the hall. + +
3. Move every nonmetallic weapon one room counterclockwise. If Professor +Plum is in a room with a weapon, place it in the kitchen; otherwise, place +the Candlestick in the same room as Plum. + +
4. Place the weapon that is in the same room as the character who is a +Reverend in Cluedo (the British version of Clue) on the Stairway. Move the +character closest to the Billiard Room to the Dining Room. + +
5. Move each weapon (except the one on the Stairway) clockwise two rooms, +unless the weapon's name contains a K, in which case move it two rooms +counterclockwise. Move Mr. Green to the only empty room that has a secret +passage. + +
6. If there are more black knights than white knights on the chessboard, +switch the positions of Colonel Mustard and the Rope. Otherwise, switch the +positions of Miss Scarlet and the Gun. Place the weapon currently in Miss +Peacock's room on the hub of the Trivial Pursuit board. + +
7. If moving all of the weapons one room clockwise would put a weapon in a +room that starts with the same letter, move all of the pieces from the +Study to the Library. If moving all of the weapons one room +counterclockwise would put a weapon in a room that starts with the same +letter, move all of the pieces from the Stairway to the Hall. + +
8. Using common occupational gender stereotypes, move every male piece in +the Hall to the Kitchen, move every female piece in the Hall to the +Billiard Room, and move every nonliving piece in the Hall to the Lazyr Zone. + +
9. Place an unused Scrabble "C" tile in every empty room. Switch the +positions of the Lead Pipe and the Wrench. The items in the Study and the +Lounge together form a word that describes the person in the Billiard Room. + +
10. Place the darkest-colored piece on the board to the same space Mrs. +White is on. Pick up the wrench and throw it at the nearest MIT administrator. + +
* The 4th letter of the answer is the initial of the last name of the +suspect currently closest to the Gun. + +
* The 10th letter of the answer is the initial of the last name of the +suspect who has been revealed as dishonest. + +
At the end of any turn: + +
IF the name of a piece from Clue or Escape From Zyzzlvaria has been spelled +on the Scrabble board this turn, THEN place that piece on the space +immediately after the last letter of the name of the piece. + +
IF one color wedge is in all six Trivial Pursuit pies, THEN place the Clue +piece of that color on the chessboard one square to the right of the black +king (unless that Clue piece is already on the Chessboard.) + +
IF Colonel Mustard is on the Immunity Zone, THEN get out a copy of Risk and +declare war on Germany. + +
IF three rooks have moved and the fourth has not, THEN place that fourth +rook in the Lounge. + +
IF any piece is in the Reverse Dimension, THEN every black piece on the +chessboard becomes white and vice versa. + +
IF the two kings or the two queens are on adjacent squares, THEN move the +white queen to the square opposite the square it is currently on (reflected +through the center of the board.) + +
IF Mr. Green has been moved exactly as many times as the white king, and +the distance between the hub and the green pie is exactly the same as the +distance between the Lazyr Zone and Leah and the total points on the +Scrabble board add up to 142, THEN you really need to chill out, dude. + +
IF a pie is on the hub of the Trivial Pursuit, THEN place the piece from +Zyzzlvaria of the same color as that pie on the hub. + +
IF three Clue characters are in the same room, THEN place the one whose +last name comes alphabetically last on the Immunity Zone. + +
IF there is a 2x2 square of vowels on the Scrabble board, THEN replace the +upper-left and lower-right tiles in that square with the letter L. + +
IF OVA has been spelled on the Scrabble board this turn, THEN lay an egg. + +
IF THEDAN has been spelled on the Scrabble board this turn, treat it as a +sign from God, genuflect and join an appropriate cult. + + + + + diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_04_Puzzle.html/checkanswer.js b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_04_Puzzle.html/checkanswer.js new file mode 100644 index 0000000000000000000000000000000000000000..cc5741feb1f623cca1b1cf7c57a0777a0c66117b --- /dev/null +++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_04_Puzzle.html/checkanswer.js @@ -0,0 +1,281 @@ +// Do this first so that layout shift isn't too bad: +const container = document.createElement("div"); +container.style = ` + font-size: 16px; + font-size: clamp(16px, 2.4vw, 21px); + height: 2.5em; +`; +document.body.prepend(container); + +import { React, html, css, render } from "./package.js"; + +/** + * Remove non-alphanumeric characters. + */ +const normalizeAnswer = (answer) => { + if (getYear() === 2003) { + if (document.URL.includes("teamGuest/2")) { + // Special case: 2003 R2, whose answers are emoji. + return answer.trim(); + } else if (document.URL.includes("6_3")) { + // Special case: Answer is literal Greek letter. + return answer.trim(); + } + } + return answer.toUpperCase().replaceAll(/[^A-Z0-9]/g, ""); +}; + +/** + * Returns the year of the hunt we're in. + */ +const getYear = () => { + return Number(RegExp(`^.*/([0-9]{4})/.*$`).exec(document.URL)?.[1] ?? 0); +}; + +/** + * Fetches the answers as a list of {url, answer, prompt, intermediate}. + */ +const getData = async () => { + const res = await fetch("/answers.tsv"); + const data = await res.text(); + const [header, ...body] = data.split("\n"); + const headers = header.trim().split("\t"); + return body.map((row) => { + const res = {}; + row.split("\t").forEach((item, i) => { + res[headers[i]] = item.trim(); + }); + return res; + }); +}; + +/** + * Gets the base URL; removes trailing index.html and .html, removes everything + * before the year, and then removes trailing slash. + */ +const getBase = (url) => { + const root = + RegExp(`^(.*/)index.html`).exec(url)?.[1] ?? + RegExp(`^(.*).html`).exec(url)?.[1] ?? + url; + const base = RegExp(`^.*/([0-9]{4}/.*)$`).exec(root)?.[1] ?? root; + return base.endsWith("/") ? base.slice(0, -1) : base; +}; + +/** + * Get all rows in the data corresponding to a given URL. Group by same prompt. + */ +const getAnswers = (data, url) => { + const base = getBase(url); + const rows = data.filter((row) => getBase(row.url) === base); + const prompts = []; + for (const row of rows) { + const { prompt } = row; + const group = prompts.find((group) => group.prompt === prompt); + if (group) { + group.rows.push(row); + } else { + prompts.push({ prompt, rows: [row] }); + } + } + return prompts; +}; + +/** + * A single textbox and submit button in the rows of possible responses. + */ +const ResponseRow = ({ prompt, rows, setFeedback }) => { + const [response, setResponse] = React.useState(""); + + const form = css` + align-items: baseline; + display: flex; + justify-content: right; + margin-bottom: 0.5em; + + @media (max-width: 600px) { + align-items: flex-start; + flex-direction: column; + } + `; + + const input = css` + background: #fafafa; + border: 1px solid #aaa; + border-radius: 2px; + color: #121212; + font-family: inherit; + font-size: 100%; + line-height: 1.2; + margin: 0 0.5em; + padding: 0.25em 0.5em; + + @media (max-width: 600px) { + margin: 0 0 0.25em; + } + `; + + const onSubmit = (e) => { + e.preventDefault(); + let set = false; + for (const row of rows) { + const correct = normalizeAnswer(row.answer) === normalizeAnswer(response); + if (correct) { + setFeedback( + row.intermediate?.trim() === "TRUE" + ? "Correct! See the solution page for the answer." + : `Solved! The answer was ${row.answer}.` + ); + set = true; + break; + } + } + if (!set) { + setFeedback("Incorrect."); + } + }; + + const onChange = (e) => setResponse(e.target.value); + + return html` +
+ `; +}; + +/** + * Check answer button, rendered at top of page. + */ +const CheckButton = ({ prompts }) => { + const [open, setOpen] = React.useState(false); + const [feedback, setFeedback] = React.useState("Call in an answer."); + + const wrapper = css` + font-family: "PT Sans", sans-serif; + font-size: 16px; + font-size: clamp(16px, 2.4vw, 21px); + height: 2.5em; + + button { + background: #555; + border: none; + border-radius: 2px; + color: #fff; + cursor: pointer; + display: inline-block; + font-size: 1em; + font-family: "PT Sans", sans-serif; + font-weight: bold; + line-height: 1.2; + padding: 0.25em 1em; + text-align: center; + text-decoration: none; + text-transform: none; + } + + p { + margin: 0 0 1em; + } + + a { + color: inherit !important; + } + `; + + const btnTop = [2015, 2016].includes(getYear()) + ? "50px" + : [2012].includes(getYear()) + ? "-2.5em" + : "0px"; + + const button = css` + box-sizing: border-box; + height: 2.5em; + left: 0; + position: absolute; + top: ${btnTop}; + width: 100%; + z-index: 9999; + `; + + const dropdownWrapper = css` + background: #edeff0; + color: #121212; + left: 0; + position: absolute; + right: 0; + top: calc(2.5em + ${btnTop}); + z-index: 9999; + `; + + const dropdown = css` + margin: 0 auto; + max-width: 40em; + padding: 1em; + z-index: 9999; + `; + + const responses = css` + margin: 0 auto; + width: fit-content; + + @media (max-width: 600px) { + width: auto; + } + `; + + const onClick = () => setOpen(!open); + + const body = + prompts.length > 0 + ? prompts.map( + (group) => + html`<${ResponseRow} setFeedback=${setFeedback} ...${group} />` + ) + : html`+ No answers found on this page. Please report this to${" "} + puzzle@mit.edu. +
`; + + return html` + +${feedback}
+| + + +Round 2 + + | ++ 2002 MIT Mystery Hunt + |
+
- D2: THE MIGHTY DUCK KONUNDRUM (solution)
+
- USE OF GOTHICISM CONSIDERED HARMFUL (solution)
+
- FIGHT CLUB (solution)
+
- HOW TO BE A MILLIONAIRE (solution)
+
+
+
+
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/1183 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/1183
new file mode 100644
index 0000000000000000000000000000000000000000..41ffc918d4b5b251ebb7a26a2af5b0d2f5c0e4e1
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/1183
@@ -0,0 +1,21 @@
+"three""rings""for the""elven kings""under the""sky,"
+"seven for the""dwarf-lords""in their""halls of stone,"
+"nine for mortal men""doomed to die,"
+"one for the""dark lord"" on his ""dark throne"
+"in the land of ""mordor ""where the ""shadows lie."
+"one ring to""rule them all.""one ring to""find them,"
+"one ring to""bring them all""and in the darkness""bind them"
+"in the land of""mordor""where the""shadows lie"
+"\n""""p""p"pppppppppppppppppp
+"elven kings"gh"mordor "gh"elven kings"gtth"dwarf-lords"gh
+"rings"gh"dark throne"gh"mordor"gttttttth"dwarf-lords"gth"rings"
+gh"rings"gh"dwarf-lords"gth"rings"gtth"mordor"gtth"rule them all."
+gh"elven kings"gh"mordor "gtth"rings"gh"rings"gth"rings"
+gttth"mordor"gtth"doomed to die,"gh"bind them"gh"mordor"h"one ring"
+tth"mordor"gtth"dark throne"gth"elven kings"gh"mordor "gtth"rings"
+gh"rings"gth"mordor"gh"dwarf-lords"gh"bind them"gttth"p""rings"
+gtth"bring them all"gh"ring"ttth"ring"h"bind them"gh"mordor"h
+"mortal men"h"mordor"gh"rule them all."gth"ring"ttth"mordor"
+gtth"land of mordor"h"bind them"gh"rule them all."gth"ring"
+ttth"sky,"gh"bind them"gh"ring"ttth"one ring"tth""g
++++++++++++++++++++++++++++++++++++++++++++++++++++++o
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/132 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/132
new file mode 100644
index 0000000000000000000000000000000000000000..62e9baa89f67b56d36e96a6a005dc6d924a055d3
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/132
@@ -0,0 +1,12 @@
+```s`k.-``
+si``si``s`
+kr``si``s`
+k.-``s`k.-
+``s`kr``s`
+k.-``si``s
+`k.-``s`kr
+``s`k.-``s
+`k.-``si``
+s`kr``si``
+si``s`k.-`
+`s`kr`kr.s
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/180 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/180
new file mode 100644
index 0000000000000000000000000000000000000000..9670b9af8a3631f9ac52cc41829a4d756c996230
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/180
@@ -0,0 +1,12 @@
+++++[>++++<-]>
+[>+>+++>++>+++
+++>+++++++<<<<
+<-]>[>]<[>+>+<
+<-]<++++.>>---
+-----.---.+++<
+<---<.>--->>+>
+++<++>++<+.---
+----.>..<.>--.
+<++<<---<.>---
+>>++.>+.<<<<.>
+---.<<--.<---.
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/1840 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/1840
new file mode 100644
index 0000000000000000000000000000000000000000..1f12d05b7c7fc83fe01dcc1d1610a87715622e6e
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/1840
@@ -0,0 +1,53 @@
+Baked Herb Casserole
+
+This will create a curiously zesty and powerfully moving baked delight.
+
+Ingredients.
+1 heaped cup flour
+64 tablespoons butter
+96 tablespoons margarine
+4 cups Hormel Potted Meat Food Product
+12 cups Armour Star Pork Brains
+3 bread crumbs
+11 Graham crackers
+32 Froot Loops
+14 g anise
+13 g basil
+22 g caraway
+9 pinches catnip
+20 g cilantro
+1 pinch dill
+5 g ginger
+20 g lovage
+18 g parsley
+1 pinch rosemary
+15 g rue
+2 pinches saffron
+2 g thyme
+
+Cooking time: 1 hour
+
+Pre-heat oven to 177 degrees Celsius.
+
+Method.
+Put dill into mixing bowl. Put cilantro into mixing bowl. Put saffron
+into mixing bowl. Put basil into mixing bowl. Melt the butter. Warm
+the Hormel Potted Meat Food Product. Add flour to mixing bowl. Stir
+bread crumbs into the mixing bowl. Heat the Hormel Potted Meat Food
+Product until warmed. Beat the butter until melted. Liquefy contents
+of the mixing bowl. Pour contents of the mixing bowl into the 1st
+baking dish. Clean mixing bowl. Put anise into mixing bowl. Put rue
+into mixing bowl. Put catnip into mixing bowl. Put lovage into mixing
+bowl. Put dill into mixing bowl. Put catnip into mixing bowl. Put
+caraway into mixing bowl. Put ginger into mixing bowl. Put parsley
+into mixing bowl. Put thyme into mixing bowl. Put thyme into mixing
+bowl. Put rosemary into mixing bowl. Blend the margarine. Thrash the
+Armour Star Pork Brains. Add flour to mixing bowl. Stir Graham
+crackers into the mixing bowl. Grind the Armour Star Pork Brains until
+thrashed. Pound the margarine until blended. Liquefy contents of the
+mixing bowl. Pour contents of the mixing bowl into the 3rd baking dish.
+Clean mixing bowl. Put Froot Loops into mixing bowl. Liquefy contents
+of the mixing bowl. Pour contents of the mixing bowl into the 2nd
+baking dish. Clean mixing bowl.
+
+Serves 3.
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/194 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/194
new file mode 100644
index 0000000000000000000000000000000000000000..fe8dd6acd50f2a7dcf30cc8df1469d450daae6d5
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/194
@@ -0,0 +1,4 @@
+ 45f6687923706969656c742360612e204225220efd)
+ =W===========================================
+F C I
+ < = F
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/198 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/198
new file mode 100644
index 0000000000000000000000000000000000000000..2906c0adf0ab79667540c19433c714b552b7b028
Binary files /dev/null and b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/198 differ
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/241 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/241
new file mode 100644
index 0000000000000000000000000000000000000000..3a5673efdff5a8cdf6f29f71e789322ffa7dca8d
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/241
@@ -0,0 +1,6 @@
+[[$32=~][,]#[$32=][,]#]p:[[$0>][3O\3O\3O\1-]#%]r:
+2$$$$****3$*5*$1+\24r;!\$@@$p;!%$p;!\$@@$p;!\%p;!
+%$$$p;!%%$$p;!\$@\$@\p;!%p;!\%p;!\%p;!%p;!\$@@p;!
+%%$$p;!\%$$p;!\$@@$p;!%%$$p;!10,\p;!\$@\$@\p;!\$@
+$@p;!%$$$p;!\p;!\$@\$@p;!%p;!\%p;!%%%"
+"
diff --git a/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/600 b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/600
new file mode 100644
index 0000000000000000000000000000000000000000..1f44a20907cd5c8f06076a75dd75a099687aa594
--- /dev/null
+++ b/benchmark/MIT_Mystery_Hunt/puzzles/by_tsv/2002/2002_round2_05_Puzzle.html/600
@@ -0,0 +1,9 @@
+v >v >v >v >v >v >v >\5v >v
+>159*54*+>\:2\`|\>:3\`|\>:4\`|\>:5\`|\>:6\`|\>:7\`|\>:8\`| >:9\`|\
+ \ v+ <3< +8< -8< -6< +8< -8-9< ++4* <31/2<
+ + : >$^ >$^ >$^ >$^ >$^ >$^ >$^ $
+ 1 , v< 1 v9