Copied updated slides across

[cipher-training.git] / slides / keyword-break.html

diff --git a/slides/keyword-break.html b/slides/keyword-break.html
index 49160bbb4fe394a3a5f9d88a05a797c62b732372..ddf82c1cf338e3ec71c9cf923a7c4242cf8d4dc7 100644 (file)
--- a/slides/keyword-break.html
+++ b/slides/keyword-break.html
@@ -36,6 +36,11 @@
         color: #ff6666;
         text-shadow: 0 0 20px #333;
         padding: 2px 5px;
+      }
+      .indexlink {
+        position: absolute;
+        bottom: 1em;
+        left: 1em;
       }
        .float-right {
         float: right;
@@ -53,6 +58,12 @@ k | e | y | w | o | r | d | a | b | c | f | g | h | i | j | l | m | n | p | q |
 
 ---
 
+layout: true
+
+.indexlink[[Index](index.html)]
+
+---
+
 # Duplicate and extend your `affine_break()` function
 
 * How to cycle through all the keys? What _are_ all the keys?
@@ -104,7 +115,11 @@ for each key:
 
 Repetition of code is a bad smell.
 
-Separate the 'try all keys, keep the best' logic from the 'score this one key' logic.
+Separate out
+
+* enumerate the keys
+* score a key
+* find the key with the best score
 
 ---