aboutsummaryrefslogtreecommitdiff
path: root/2015/11/puzzle-2
diff options
context:
space:
mode:
Diffstat (limited to '2015/11/puzzle-2')
-rw-r--r--2015/11/puzzle-213
1 files changed, 7 insertions, 6 deletions
diff --git a/2015/11/puzzle-2 b/2015/11/puzzle-2
index 444ce35..089865d 100644
--- a/2015/11/puzzle-2
+++ b/2015/11/puzzle-2
@@ -1,9 +1,10 @@
-This continues from the last puzzle, so our starting string is "hepxxyzz"
+This continues from the last puzzle, so our starting string is “hepxxyzz”
-Following the theme of the previous puzzle, we want to create an "xxyzz" pattern in the lowest
-amount of increments possible. Since the string currently ends in "xxyzz", we know that the next
-possible value we could have that satisfies this property is "aabcc". In order to go from "xxyzz" to
-"aabcc" however, you need to overflow which would increment the "p" to a "q". This gives an end
-result of "heqaabcc".
+Following the theme of the previous puzzle, we want to create an “xxyzz” pattern
+in the lowest amount of increments possible. Since the string currently ends in
+“xxyzz”, we know that the next possible value we could have that satisfies this
+property is “aabcc”. In order to go from “xxyzz” to “aabcc” however, you need to
+overflow which would increment the “p” to a “q”. This gives an end result of
+“heqaabcc”.
QED.