|
2 | 2 |
|
3 | 3 | | Part 1 | Part 2 | |
4 | 4 | |--------|--------| |
5 | | -| ` ` | ` ` | |
| 5 | +| `2946` | `1222` | |
6 | 6 |
|
7 | 7 | ## --- Day 18: Many-Worlds Interpretation --- |
8 | 8 |
|
@@ -33,7 +33,7 @@ Then, you can move `6` steps to collect the only other key, `b`: |
33 | 33 | ######### |
34 | 34 |
|
35 | 35 |
|
36 | | -So, collecting every key took a total of `_8_` steps. |
| 36 | +So, collecting every key took a total of _`8`_ steps. |
37 | 37 |
|
38 | 38 | Here is a larger example: |
39 | 39 |
|
@@ -80,7 +80,7 @@ Now, you have a choice between keys `d` and `e`. While key `e` is closer, collec |
80 | 80 | ######################## |
81 | 81 |
|
82 | 82 |
|
83 | | -Finally, collect key `e` to unlock door `E`, then collect key `f`, taking a grand total of `_86_` steps. |
| 83 | +Finally, collect key `e` to unlock door `E`, then collect key `f`, taking a grand total of _`86`_ steps. |
84 | 84 |
|
85 | 85 | Here are a few more examples: |
86 | 86 |
|
@@ -142,14 +142,14 @@ Update your map to instead use the correct data: |
142 | 142 |
|
143 | 143 | This change will split your map into four separate sections, each with its own entrance: |
144 | 144 |
|
145 | | - ####### ####### |
146 | | - #a.#Cd# #a.#Cd# |
147 | | - ##...## ##@#@## |
148 | | - ##.@.## --> ####### |
149 | | - ##...## ##@#@## |
150 | | - #cB#Ab# #cB#Ab# |
151 | | - ####### ####### |
152 | | - |
| 145 | +<pre><code>####### ####### |
| 146 | +#a.#Cd# #a.#Cd# |
| 147 | +##...## ##<b>@#@</b>## |
| 148 | +##.@.## --> ##<b>###</b>## |
| 149 | +##...## ##<b>@#@</b>## |
| 150 | +#cB#Ab# #cB#Ab# |
| 151 | +####### ####### |
| 152 | +</code></pre> |
153 | 153 |
|
154 | 154 | Because some of the keys are for doors in other vaults, it would take much too long to collect all of the keys by yourself. Instead, you deploy four remote-controlled robots. Each starts at one of the entrances (`@`). |
155 | 155 |
|
@@ -238,7 +238,7 @@ Here's a more complex example: |
238 | 238 | * Bottom-right robot collects key `k`. |
239 | 239 | * Top-right robot collects key `l`. |
240 | 240 |
|
241 | | -In the above example, the fewest steps to collect all of the keys is `_32_`. |
| 241 | +In the above example, the fewest steps to collect all of the keys is _`32`_. |
242 | 242 |
|
243 | 243 | Here's an example with more choices: |
244 | 244 |
|
@@ -271,6 +271,6 @@ One solution with the fewest steps is: |
271 | 271 | * Bottom-left robot collects key `m`. |
272 | 272 | * Bottom-left robot collects key `o`. |
273 | 273 |
|
274 | | -This example requires at least `_72_` steps to collect all keys. |
| 274 | +This example requires at least _`72`_ steps to collect all keys. |
275 | 275 |
|
276 | 276 | After updating your map and using the remote-controlled robots, _what is the fewest steps necessary to collect all of the keys?_ |
0 commit comments