more debugging printouts

day15/d15p2.swift

@@ -44,10 +44,13 @@ struct Map: CustomStringConvertible {
         var s: [[String]] = Array(
             repeating: Array(repeating: "  ", count: w*2), count: h
         )
-        walls.forEach { w in s[w.y][w.x] = "██" }
-        boxes.boxes.forEach { b in s[b.y][b.x] = "🮇🮀"; s[b.y][b.x+1] = "🮀▌" }
-        s[bot.y][bot.x] = "🮕🮕"
-        return s.map { row in row.joined() }.joined(separator: "\n")
+        walls.forEach { w in s[w.y][w.x] = "🮘🮘" }
+        boxes.boxes.forEach { b in s[b.y][b.x] = "🬴🬰"; s[b.y][b.x+1] = "🬰🬸" }
+        s[bot.y][bot.x] = "\u{001B}[91m🮿 \u{001B}[0m"
+        return ("    " + (0..<w).map { String(format: "%4d", $0 % 1000) }.joined() + "\n") +
+            s.enumerated().map {
+                i, row in String(format: "%3d ", i) + row.joined()
+            }.joined(separator: "\n")
     }
     var gps: Int { return boxes.boxes.reduce(0) { s, box in s + box.gps } }
 
@@ -106,10 +109,11 @@ func readInput(_ filePath: String) throws -> (Map, [Move]) {
 }
 
 var (map, moves) = try readInput(CommandLine.arguments[1])
-print(map)
 print(moves)
 for move in moves {
+    print(map)
     map.move(move)
+    print(move)
 }
 print(map)
 print(map.gps)

day16/d16p1.swift

@@ -58,8 +58,8 @@ struct Maze : CustomStringConvertible {
         let s: [[String]] = walls.enumerated().map { i, r in
             [String(format: "%3d ", i)] + r.map { $0 ? "██" : "  " }
         }
-        print("    " + (0..<w).map { " \($0 % 10)" }.joined())
-        return s.map { $0.joined() }.joined(separator: "\n")
+        return ("    " + (0..<w).map { " \($0 % 10)" }.joined()) +
+            s.map { $0.joined() }.joined(separator: "\n")
     }
     init(fromFile f: String) throws {
         let content = try String(contentsOfFile: f, encoding: .ascii)

day16/d16p2.swift

@@ -146,6 +146,7 @@ struct AoC {
     static func main() throws {
         let maze = try Maze(fromFile: CommandLine.arguments[1])
         let (graph, pathPairs) = maze.graph()
+        print("maze: \(maze.w)x\(maze.h) intersections: \(graph.count)")
         let visited = search(graph: graph, start: maze.start)
         let minCost = maze.ends.compactMap { visited[$0] }.map { $0.0 }.min()!
         print("minCost: \(minCost)")