Add note about sortingHEADmaster

1 files changed, 3 insertions, 0 deletions

diff --git a/17/day-17.lisp b/17/day-17.lisp
index 26c559a..81a289b 100644
--- a/17/day-17.lisp
+++ b/17/day-17.lisp
@@ -59,6 +59,9 @@ source file, since the Makefile runs from the top-level directory.")
       ;; Once we've reached the end and there's no chance of finding a shorter
       ;; path, return the shortest path.
       ((or (null queue)
+           ;; TODO: find a shortest path if it has the minimum cost in the
+           ;; queue currently, but it's not the first element (e.g. if there
+           ;; are more paths with equal cost sorted before it).
            (equalp (vec2 (1- width) (1- height)) (city-path-coords (car queue))))
        (car queue))
     (ematch (pop queue)