Fixes emphasis in 2018 READMEs

romellem · romellem · commit 9527d0807b97 · 2020-12-08T22:09:34.000-06:00
diff --git a/2018/10/README.md b/2018/10/README.md
@@ -146,14 +146,14 @@ Over time, the points listed above would move like this:
     ......................
     
 
-After 3 seconds, the message appeared briefly: `_HI_`. Of course, your message will be much longer and will take many more seconds to appear.
+After 3 seconds, the message appeared briefly: _`HI`_. Of course, your message will be much longer and will take many more seconds to appear.
 
 _What message will eventually appear in the sky?_
 
 -----------------
 
 ## --- Part Two ---
 
-Good thing you didn't have to wait, because that would have taken a long time - much longer than the `_3_` seconds in the example above.
+Good thing you didn't have to wait, because that would have taken a long time - much longer than the _`3`_ seconds in the example above.
 
 Impressed by your sub-hour communication capabilities, the Elves are curious: _exactly how many seconds would they have needed to wait for that message to appear?_
diff --git a/2018/11/README.md b/2018/11/README.md
@@ -27,14 +27,14 @@ The power level in a given fuel cell can be found through the following process:
 
 For example, to find the power level of the fuel cell at `3,5` in a grid with serial number `8`:
 
-*   The rack ID is `3 + 10 = _13_`.
-*   The power level starts at `13 * 5 = _65_`.
-*   Adding the serial number produces `65 + 8 = _73_`.
-*   Multiplying by the rack ID produces `73 * 13 = _949_`.
-*   The hundreds digit of `_9_49` is `_9_`.
-*   Subtracting 5 produces `9 - 5 = _4_`.
+*   The rack ID is <code>3 + 10 = <em>13</em></code>.
+*   The power level starts at <code>13 * 5 = <em>65</em></code>.
+*   Adding the serial number produces <code>65 + 8 = <em>73</em></code>.
+*   Multiplying by the rack ID produces <code>73 * 13 = <em>949</em></code>.
+*   The hundreds digit of <code><em>9</em>49</code> is _`9`_.
+*   Subtracting 5 produces <code>9 - 5 = <em>4</em></code>.
 
-So, the power level of this fuel cell is `_4_`.
+So, the power level of this fuel cell is _`4`_.
 
 Here are some more example power levels:
 
@@ -44,7 +44,7 @@ Here are some more example power levels:
 
 Your goal is to find the 3x3 square which has the largest total power. The square must be entirely within the 300x300 grid. Identify this square using the `X,Y` coordinate of its _top-left fuel cell_. For example:
 
-For grid serial number `18`, the largest total 3x3 square has a top-left corner of `_33,45_` (with a total power of `29`); these fuel cells appear in the middle of this 5x5 region:
+For grid serial number `18`, the largest total 3x3 square has a top-left corner of _`33,45`_ (with a total power of `29`); these fuel cells appear in the middle of this 5x5 region:
 
     -2  -4   4   4   4
     -4   4   4   4  -5
@@ -53,7 +53,7 @@ For grid serial number `18`, the largest total 3x3 square has a top-left corner
     -1   0   2  -5  -2
     
 
-For grid serial number `42`, the largest 3x3 square's top-left is `_21,61_` (with a total power of `30`); they are in the middle of this region:
+For grid serial number `42`, the largest 3x3 square's top-left is _`21,61`_ (with a total power of `30`); they are in the middle of this region:
 
     -3   4   2   2   2
     -4   4   3   3   4
@@ -74,7 +74,7 @@ Realizing this, you now must find the _square of any size with the largest total
 
 For example:
 
-*   For grid serial number `18`, the largest total square (with a total power of `113`) is 16x16 and has a top-left corner of `90,269`, so its identifier is `_90,269,16_`.
-*   For grid serial number `42`, the largest total square (with a total power of `119`) is 12x12 and has a top-left corner of `232,251`, so its identifier is `_232,251,12_`.
+*   For grid serial number `18`, the largest total square (with a total power of `113`) is 16x16 and has a top-left corner of `90,269`, so its identifier is _`90,269,16`_.
+*   For grid serial number `42`, the largest total square (with a total power of `119`) is 12x12 and has a top-left corner of `232,251`, so its identifier is _`232,251,12`_.
 
 _What is the `X,Y,size` identifier of the square with the largest total power?_
diff --git a/2018/12/README.md b/2018/12/README.md
@@ -71,7 +71,7 @@ The generation is shown along the left, where `0` is the initial state. The pot
 
 After one generation, only seven plants remain. The one in pot `0` matched the rule looking for `..#..`, the one in pot `4` matched the rule looking for `.#.#.`, pot `9` matched `.##..`, and so on.
 
-In this example, after 20 generations, the pots shown as `#` contain plants, the furthest left of which is pot `-2`, and the furthest right of which is pot `34`. Adding up all the numbers of plant-containing pots after the 20th generation produces `_325_`.
+In this example, after 20 generations, the pots shown as `#` contain plants, the furthest left of which is pot `-2`, and the furthest right of which is pot `34`. Adding up all the numbers of plant-containing pots after the 20th generation produces _`325`_.
 
 _After `20` generations, what is the sum of the numbers of all pots which contain a plant?_
 
diff --git a/2018/13/README.md b/2018/13/README.md
@@ -170,7 +170,7 @@ After following their respective paths for a while, the carts eventually crash.
     5  \------/   
     
 
-In this example, the location of the first crash is `_7,3_`.
+In this example, the location of the first crash is _`7,3`_.
 
 -----------------
 
diff --git a/2018/14/README.md b/2018/14/README.md
@@ -0,0 +1,47 @@
+# Answers
+
+|    Part 1    |   Part 2   |
+| ------------ | ---------- |
+| `6910849249` | `20330673` |
+
+## --- Day 14: Chocolate Charts ---
+
+You finally have a chance to look at all of the produce moving around. Chocolate, cinnamon, mint, chili peppers, nutmeg, vanilla... the Elves must be growing these plants to make _hot chocolate_! As you realize this, you hear a conversation in the distance. When you go to investigate, you discover two Elves in what appears to be a makeshift underground kitchen/laboratory.
+
+The Elves are trying to come up with the ultimate hot chocolate recipe; they're even maintaining a scoreboard which tracks the quality _score_ (`0`-`9`) of each recipe.
+
+Only two recipes are on the board: the first recipe got a score of `3`, the second, `7`. Each of the two Elves has a _current recipe_: the first Elf starts with the first recipe, and the second Elf starts with the second recipe.
+
+To create new recipes, the two Elves combine their current recipes. This creates new recipes from the _digits of the sum_ of the current recipes' scores. With the current recipes' scores of `3` and `7`, their sum is `10`, and so two new recipes would be created: the first with score `1` and the second with score `0`. If the current recipes' scores were `2` and `3`, the sum, `5`, would only create one recipe (with a score of `5`) with its single digit.
+
+The new recipes are added to the end of the scoreboard in the order they are created. So, after the first round, the scoreboard is `3, 7, 1, 0`.
+
+After all new recipes are added to the scoreboard, each Elf picks a new current recipe. To do this, the Elf steps forward through the scoreboard a number of recipes equal to _1 plus the score of their current recipe_. So, after the first round, the first Elf moves forward `1 + 3 = 4` times, while the second Elf moves forward `1 + 7 = 8` times. If they run out of recipes, they loop back around to the beginning. After the first round, both Elves happen to loop around until they land on the same recipe that they had in the beginning; in general, they will move to different recipes.
+
+Drawing the first Elf as parentheses and the second Elf as square brackets, they continue this process:
+
+    (3)[7]
+    (3)[7] 1  0
+     3  7  1 [0](1) 0
+     3  7  1  0 [1] 0 (1)
+    (3) 7  1  0  1  0 [1] 2
+     3  7  1  0 (1) 0  1  2 [4]
+     3  7  1 [0] 1  0 (1) 2  4  5
+     3  7  1  0 [1] 0  1  2 (4) 5  1
+     3 (7) 1  0  1  0 [1] 2  4  5  1  5
+     3  7  1  0  1  0  1  2 [4](5) 1  5  8
+     3 (7) 1  0  1  0  1  2  4  5  1  5  8 [9]
+     3  7  1  0  1  0  1 [2] 4 (5) 1  5  8  9  1  6
+     3  7  1  0  1  0  1  2  4  5 [1] 5  8  9  1 (6) 7
+     3  7  1  0 (1) 0  1  2  4  5  1  5 [8] 9  1  6  7  7
+     3  7 [1] 0  1  0 (1) 2  4  5  1  5  8  9  1  6  7  7  9
+     3  7  1  0 [1] 0  1  2 (4) 5  1  5  8  9  1  6  7  7  9  2
+
+The Elves think their skill will improve after making a few recipes (your puzzle input). However, that could take ages; you can speed this up considerably by identifying _the scores of the ten recipes_ after that. For example:
+
+-   If the Elves think their skill will improve after making `9` recipes, the scores of the ten recipes _after_ the first nine on the scoreboard would be `5158916779` (highlighted in the last line of the diagram).
+-   After `5` recipes, the scores of the next ten would be `0124515891`.
+-   After `18` recipes, the scores of the next ten would be `9251071085`.
+-   After `2018` recipes, the scores of the next ten would be `5941429882`.
+
+_What are the scores of the ten recipes immediately after the number of recipes in your puzzle input?_
diff --git a/2018/18/README.md b/2018/18/README.md
@@ -157,7 +157,7 @@ For example, suppose the lumber collection area is instead only 10 by 10 acres w
     ||||||||||
     
 
-After 10 minutes, there are `37` wooded acres and `31` lumberyards. Multiplying the number of wooded acres by the number of lumberyards gives the total _resource value_ after ten minutes: `37 * 31 = _1147_`.
+After 10 minutes, there are `37` wooded acres and `31` lumberyards. Multiplying the number of wooded acres by the number of lumberyards gives the total _resource value_ after ten minutes: <code>37 * 31 = <em>1147</em></code>.
 
 _What will the total resource value of the lumber collection area be after 10 minutes?_
 
diff --git a/2018/22/README.md b/2018/22/README.md
@@ -275,6 +275,6 @@ For example, using the same cave system as above, starting in the top left corne
     ||.|==.|.|.||=||
     
 
-This is tied with other routes as the _fastest way to reach the target_: `_45_` minutes. In it, `21` minutes are spent switching tools (three times, seven minutes each) and the remaining `24` minutes are spent moving.
+This is tied with other routes as the _fastest way to reach the target_: _`45`_ minutes. In it, `21` minutes are spent switching tools (three times, seven minutes each) and the remaining `24` minutes are spent moving.
 
 _What is the fewest number of minutes you can take to reach the target?_
diff --git a/2018/25/README.md b/2018/25/README.md
@@ -40,7 +40,7 @@ Two points are in the same _constellation_ if their manhattan distance apart is
     12,0,0,0
     
 
-In the above list, the first six points form a single constellation: `0,0,0,0` is exactly distance `3` from the next four, and the point at `0,0,0,6` is connected to the others by being `3` away from `0,0,0,3`, which is already in the constellation. The bottom two points, `9,0,0,0` and `12,0,0,0` are in a separate constellation because no point is close enough to connect them to the first constellation. So, in the above list, the number of constellations is `_2_`. (If a point at `6,0,0,0` were present, it would connect `3,0,0,0` and `9,0,0,0`, merging all of the points into a single giant constellation instead.)
+In the above list, the first six points form a single constellation: `0,0,0,0` is exactly distance `3` from the next four, and the point at `0,0,0,6` is connected to the others by being `3` away from `0,0,0,3`, which is already in the constellation. The bottom two points, `9,0,0,0` and `12,0,0,0` are in a separate constellation because no point is close enough to connect them to the first constellation. So, in the above list, the number of constellations is _`2`_. (If a point at `6,0,0,0` were present, it would connect `3,0,0,0` and `9,0,0,0`, merging all of the points into a single giant constellation instead.)
 
 In this example, the number of constellations is `4`:
 
diff --git a/2018/8/README.md b/2018/8/README.md
@@ -37,7 +37,7 @@ In this example, each node of the tree is also marked with an underline starting
 *   `C`, which has `1` child node (`D`) and `1` metadata entry (`2`).
 *   `D`, which has `0` child nodes and `1` metadata entry (`99`).
 
-The first check done on the license file is to simply add up all of the metadata entries. In this example, that sum is `1+1+2+10+11+12+2+99=_138_`.
+The first check done on the license file is to simply add up all of the metadata entries. In this example, that sum is <code>1+1+2+10+11+12+2+99=<em>138</em></code>.
 
 _What is the sum of all metadata entries?_
 
@@ -56,7 +56,7 @@ However, if a node _does have child nodes_, the metadata entries become indexes
 For example, again using the above nodes:
 
 *   Node `C` has one metadata entry, `2`. Because node `C` has only one child node, `2` references a child node which does not exist, and so the value of node `C` is `0`.
-*   Node `A` has three metadata entries: `1`, `1`, and `2`. The `1` references node `A`'s first child node, `B`, and the `2` references node `A`'s second child node, `C`. Because node B has a value of `33` and node `C` has a value of `0`, the value of node `A` is `33+33+0=_66_`.
+*   Node `A` has three metadata entries: `1`, `1`, and `2`. The `1` references node `A`'s first child node, `B`, and the `2` references node `A`'s second child node, `C`. Because node B has a value of `33` and node `C` has a value of `0`, the value of node `A` is <code>33+33+0=<em>66</em></code>.
 
 So, in this example, the value of the root node is `66`.
 
diff --git a/2018/9/README.md b/2018/9/README.md
@@ -46,7 +46,7 @@ For example, suppose there are 9 players. After the marble with value `0` is pla
     [7]  0 16  8 17  4 18 19  2 24 20(25)10 21  5 22 11  1 12  6 13  3 14  7 15
     
 
-The goal is to be the _player with the highest score_ after the last marble is used up. Assuming the example above ends after the marble numbered `25`, the winning score is `23+9=_32_` (because player 5 kept marble `23` and removed marble `9`, while no other player got any points in this very short example game).
+The goal is to be the _player with the highest score_ after the last marble is used up. Assuming the example above ends after the marble numbered `25`, the winning score is <code>23+9=<em>32</em></code> (because player 5 kept marble `23` and removed marble `9`, while no other player got any points in this very short example game).
 
 Here are a few more examples:
 
