Skip to content

Commit 48627f8

Browse files
committed
Adds answers to README
1 parent 6dff6e8 commit 48627f8

File tree

1 file changed

+13
-13
lines changed

1 file changed

+13
-13
lines changed

2019/18/README.md

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
| Part 1 | Part 2 |
44
|--------|--------|
5-
| ` ` | ` ` |
5+
| `2946` | `1222` |
66

77
## --- Day 18: Many-Worlds Interpretation ---
88

@@ -33,7 +33,7 @@ Then, you can move `6` steps to collect the only other key, `b`:
3333
#########
3434

3535

36-
So, collecting every key took a total of `_8_` steps.
36+
So, collecting every key took a total of _`8`_ steps.
3737

3838
Here is a larger example:
3939

@@ -80,7 +80,7 @@ Now, you have a choice between keys `d` and `e`. While key `e` is closer, collec
8080
########################
8181

8282

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.
8484

8585
Here are a few more examples:
8686

@@ -142,14 +142,14 @@ Update your map to instead use the correct data:
142142

143143
This change will split your map into four separate sections, each with its own entrance:
144144

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+
##.@.## --&gt; ##<b>###</b>##
149+
##...## ##<b>@#@</b>##
150+
#cB#Ab# #cB#Ab#
151+
####### #######
152+
</code></pre>
153153

154154
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 (`@`).
155155

@@ -238,7 +238,7 @@ Here's a more complex example:
238238
* Bottom-right robot collects key `k`.
239239
* Top-right robot collects key `l`.
240240

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`_.
242242

243243
Here's an example with more choices:
244244

@@ -271,6 +271,6 @@ One solution with the fewest steps is:
271271
* Bottom-left robot collects key `m`.
272272
* Bottom-left robot collects key `o`.
273273

274-
This example requires at least `_72_` steps to collect all keys.
274+
This example requires at least _`72`_ steps to collect all keys.
275275

276276
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

Comments
 (0)