Recorded work from Monday.

greedy-algorithms/notes.md

@@ -122,8 +122,8 @@ Problem: [same as above]
 ## Choosing a Forward Edge
 
 *   Exhaustive search:
-    *   Generate …
-    *   Check that …
+    *   Generate all following locations out to a distance of `range` as long as we don't go past the final destination
+    *   Check that the chosen destination maximizes distance travelled (always favors the candidate)
 
 ## Example
 
@@ -139,12 +139,15 @@ Problem: [same as above]
 
     Location  Next Location
     --------  -------------
-    a         …
-    …
+    a         c
+    c         d
+    d         e
+    e         h
+    h         i
 
     Path
     ----
-    a → …
+    a → c → d → e → h → i
 
 --------------------------------------------------------------------------------
 

greedy-algorithms/src/features/fueling/solver.js

@@ -7,7 +7,16 @@ export function planFuelings(gaps, range) {
     gaps.every((gap) => gap <= range),
     `Tried to find a fueling plan crossing a gap longer than the range ${range}.`,
   );
-  const results = [];
-  // TODO: stub
+  const results = [0];
+  const destination = gaps.length;
+  while (results[results.length - 1] < destination) {
+    let best = undefined;
+    for (let distance = …, candidate = …;
+      distance < … && candidate < …;
+      distance += …, candidate += …) {
+      best = candidate;
+    }
+    results.push(best);
+  }
   return results;
 }