diff --git a/examples/aoc2023/day23/part2.jou b/examples/aoc2023/day23/part2.jou
index d72a86ba..241ceb52 100644
--- a/examples/aoc2023/day23/part2.jou
+++ b/examples/aoc2023/day23/part2.jou
@@ -173,7 +173,7 @@ def longest_path_dfs(graph: Graph*, avoid: bool*, current: int, depth: int) -> i
         return 0
 
     assert not avoid[current]
-    avoid[current] = True  # must reset before returning
+    avoid[current] = True
 
     best = 0
     for next = 0; next < graph->num_nodes; next++: