MIT Mystery Hunt 2020/Hackin' The Beanstalk: Difference between revisions
CoreyPlover (talk | contribs) m (Text replacement - "\[\[MIT Mystery Hunt \(20(.*)\)" to "[[MIT Mystery Hunt 20$1") |
(existence) |
||
| Line 6: | Line 6: | ||
|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 |
||
|solves = |
|solves = 71 |
||
|guesses = |
|guesses = 323 |
||
|link = |
|link = https://puzzles.mit.edu/2020/puzzle/hackin_the_beanstalk/ |
||
|solution_link = https://puzzles.mit.edu/2020/puzzle/hackin_the_beanstalk/solution/ |
|||
|solution_link = |
|||
|checker_link = |
|checker_link = |
||
|stats_link = |
|stats_link = |
||
}} |
}} |
||
'''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. |
||
| ⚫ | |||
[[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. {{spoilers|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.}} |
|||
{{spoilers|text= |
|||
==Solve Path== |
|||
[[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.}} |
|||
[INSERT SOLVE PATH] |
|||
{{spoilers|text= |
|||
[INSERT PICTURE] |
|||
[[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.}} |
|||
| ⚫ | |||
{{spoilers|text= |
|||
* [INSERT ELEMENTS] |
|||
[[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.}} |
|||
Revision as of 09:53, 22 May 2022
| Hackin' The Beanstalk | |
|---|---|
| MIT Mystery Hunt 2020 | |
| Storybook Forest | |
| Author(s) | Yar Woo, Asher Walkover; initial concept by Ian Tullis |
| 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
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 Enter reboots the terminal.
Click to revealTechnology - 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.
Click to revealError 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.
Click to revealMarked 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.
