diff --git a/examples/aoc2023/day18/part1.jou b/examples/aoc2023/day18/part1.jou
index 06dde39f..9bcdce59 100644
--- a/examples/aoc2023/day18/part1.jou
+++ b/examples/aoc2023/day18/part1.jou
@@ -74,9 +74,7 @@ def read_input_to_grid(filename: byte*) -> Grid:
                 append_blank_row(&grid)
                 grid.transpose()
 
-            assert strlen(grid.data) == (grid.width + 1)*grid.height
             grid.set([x, y], '#')
-            assert strlen(grid.data) == (grid.width + 1)*grid.height
 
     fclose(f)
     return grid
diff --git a/examples/aoc2023/day20/part2.jou b/examples/aoc2023/day20/part2.jou
index 64ac5096..7060bf9f 100644
--- a/examples/aoc2023/day20/part2.jou
+++ b/examples/aoc2023/day20/part2.jou
@@ -253,7 +253,7 @@ def main() -> int:
     #   `--> flip-flop  -->  ...  --> conjunction --> conjunction --|
     #                                                               `--> output conjunction --> rx
     #
-    # I call each row from flip-flop to single-source-conjunction a channel.
+    # I call each row from flip-flop to just before output conjunction a channel.
     channels: Module*[2][10]
 
     assert rx->nsources == 1
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++: