MIT Mystery Hunt 2020/Hackin' The Beanstalk: Difference between revisions
Content added Content deleted
m (→top: {{Infobox puzzle}}, link cleanup) |
mNo edit summary |
||
| (6 intermediate revisions by 4 users not shown) | |||
| Line 2: | Line 2: | ||
|title = <!-- Puzzle title, defaults to subpage name, but be sure to include in case of slashes or weird formatting --> |
|title = <!-- Puzzle title, defaults to subpage name, but be sure to include in case of slashes or weird formatting --> |
||
|hunt = <!-- Hunt name, defaults to page parent. Do not link with [[]]; it'll automatically do so --> |
|hunt = <!-- Hunt name, defaults to page parent. Do not link with [[]]; it'll automatically do so --> |
||
|round = Storybook Forest |
|||
|round = <!-- will also automatically link - assumes subpage of hunt page --> |
|||
|image = <!-- Should start with File: --> |
|image = <!-- Should start with File: --> |
||
|image_width = <!-- include "px", defaults to 200px --> |
|image_width = <!-- include "px", defaults to 200px --> |
||
|image_caption = |
|image_caption = |
||
|author = |
|author = Yar Woo, Asher Walkover; initial concept by Ian Tullis |
||
|author1=Yar Woo|author2=Asher Walkover|author3=Ian Tullis |
|||
|solves = |
|solves = 71 |
||
|guesses = <!-- total (correct and incorrect) --> |
|||
|guesses = 323 |
|||
|link = <!-- puzzle link, these should all be plain URLs --> |
|||
|link = https://puzzles.mit.edu/2020/puzzle/hackin_the_beanstalk/ |
|||
|solution_link = |
|||
|solution_link = https://puzzles.mit.edu/2020/puzzle/hackin_the_beanstalk/solution/ |
|||
|checker_link = |
|checker_link = |
||
|stats_link = |
|stats_link = |
||
|answer = SOURCE FILES |
|||
}} |
}} |
||
'''Hackin' The Beanstalk''' is |
'''Hackin' The Beanstalk''' is an interactive puzzle from the {{l|Storybook Forest}} round of the [[MIT Mystery Hunt 2020|2020 MIT Mystery Hunt]], presented as a computer terminal. |
||
==Solve Path== |
|||
[INSERT SOLVE PATH] |
|||
[INSERT PICTURE] |
|||
==Puzzle Elements== |
==Puzzle Elements== |
||
* [[Interactive]] - The puzzle is presented as a computer terminal—it prints a number of initialization messages (such as "Finding the best way through the woods...") before prompting the solver for input with a blinking cursor. {{spoiler|text=Pressing a key on the keyboard will cause the terminal to respond with either "unknown command" or a snippet of Python code; some only print out one set, while others will alternate between multiple pieces of code. Pressing <code>Enter</code> reboots the terminal.}} |
|||
{{spoiler|label=Spoiler-y Elements}} |
|||
* [[Technology]] - The various snippets of Python code obtained from the terminal can be assembled into implementations of eleven algorithms named after computer scientists, each of which solves one of the problems referenced in the initialization messages. For example, DIJKSTRA's algorithm corresponds to "Finding the best way through the woods..." As it turns out, the keys corresponding to the code snippets used in any given algorithm spells the eponym of that algorithm, and typing out that name in the terminal yields the whole algorithm. |
|||
* [[Error Correction]] - The algorithm you are given, however, has a single mistake. The Dijkstra implementation, for example, has <code>unvisited[min_node] < unvisited[node]:</code>, where the <code><</code> should be a <code>></code> to properly locate the closest unvisited node. |
|||
* [[Marked Elements]] - The error is localized to a single keypress in the terminal, which provides a letter to be extracted. The final answer can be obtained by ordering these letters using the message printed at the beginning. |
|||
* [INSERT ELEMENTS] |
|||
{{spoiler-end}} |
|||
Latest revision as of 22:52, 1 November 2022
| Hackin' The Beanstalk | |
|---|---|
| MIT Mystery Hunt 2020 | |
| Storybook Forest | |
| Author(s) | Yar Woo, Asher Walkover; initial concept by Ian Tullis |
| Answer | Click to revealSOURCE FILES |
| Statistics | |
| No. solves | 71 |
| No. total guesses | 323 |
| Links | |
| Puzzle | Link |
| Solution | Link |
Hackin' The Beanstalk is an interactive puzzle from the Storybook Forest round of the 2020 MIT Mystery Hunt, presented as a computer terminal.
Puzzle Elements[edit | edit source]
- Interactive - The puzzle is presented as a computer terminal—it prints a number of initialization messages (such as "Finding the best way through the woods...") before prompting the solver for input with a blinking cursor. Click to revealPressing a key on the keyboard will cause the terminal to respond with either "unknown command" or a snippet of Python code; some only print out one set, while others will alternate between multiple pieces of code. Pressing
Enterreboots the terminal.
- Technology - The various snippets of Python code obtained from the terminal can be assembled into implementations of eleven algorithms named after computer scientists, each of which solves one of the problems referenced in the initialization messages. For example, DIJKSTRA's algorithm corresponds to "Finding the best way through the woods..." As it turns out, the keys corresponding to the code snippets used in any given algorithm spells the eponym of that algorithm, and typing out that name in the terminal yields the whole algorithm.
- Error Correction - The algorithm you are given, however, has a single mistake. The Dijkstra implementation, for example, has
unvisited[min_node] < unvisited[node]:, where the<should be a>to properly locate the closest unvisited node.
- Marked Elements - The error is localized to a single keypress in the terminal, which provides a letter to be extracted. The final answer can be obtained by ordering these letters using the message printed at the beginning.
