1 files changed, 0 insertions, 107 deletions
diff --git a/aoc2022/day-16/day-16.rkt b/aoc2022/day-16/day-16.rkt
deleted file mode 100644
index 5ec56d6..0000000
--- a/aoc2022/day-16/day-16.rkt
+++ /dev/null
@@ -1,107 +0,0 @@
-#lang racket
-
-(require advent-of-code
-         fancy-app
-         graph
-         threading)
-
-(define (process-line str)
-  (match str
-    [(regexp #px"Valve (\\w\\w) has flow rate=(\\d+); tunnels? leads? to valves? (.+)"
-             (list _ name (app string->number rate) (app (string-split _ ", ") valves)))
-     (list name rate valves)]))
-
-(define cave-data
-  (~> (fetch-aoc-input (find-session) 2022 16 #:cache #true)
-      (string-split "\n")
-      (map process-line _)))
-
-(define cave-map
-  (for*/lists (tunnels #:result (directed-graph tunnels))
-              ([valve (in-list cave-data)] #:do [(match-define (list name _ valves) valve)]
-                                           [destination (in-list valves)])
-              (list name destination)))
-
-(define valve-flows
-  (for/hash ([valve (in-list cave-data)]
-             #:do [(match-define (list name flow _) valve)]
-             #:when (> flow 0))
-    (values name flow)))
-
-(define shortest-path-lengths (johnson cave-map))
-
-(define (reachable-destinations start dests minutes-left)
-  (for/list ([(dest _) (in-hash dests)]
-             #:do [(define travel-time
-                     (hash-ref shortest-path-lengths (list start dest) minutes-left))]
-             #:when (<= 1 travel-time minutes-left))
-    (cons dest travel-time)))
-
-;; part 1
-(define (find-best-single-route start
-                                [minutes-left 30]
-                                [current-pressure 0]
-                                [available-valves valve-flows])
-  (cond
-    [(>= minutes-left 1)
-     (for/fold ([running-pressure current-pressure]
-                [remaining-valves available-valves]
-                #:result (cons running-pressure remaining-valves))
-               ([candidate (reachable-destinations start available-valves minutes-left)])
-       (match-define (cons dest travel-time) candidate)
-       (define minutes-left* (- minutes-left (add1 travel-time)))
-       (match-define (cons candidate-pressure remaining-valves*)
-         (find-best-single-route dest
-                                 minutes-left*
-                                 (+ current-pressure (* (hash-ref valve-flows dest) minutes-left*))
-                                 (hash-remove available-valves dest)))
-       (if (> candidate-pressure running-pressure)
-           (values candidate-pressure remaining-valves*)
-           (values running-pressure remaining-valves*)))]
-    [else (cons current-pressure available-valves)]))
-
-(car (find-best-single-route "AA"))
-
-;; part 2
-
-(define (possible-paths start dests minutes-left)
-  (cond
-    [(or (hash-empty? dests) (< minutes-left 3)) '()]
-    [else
-     (for/fold ([path '()]) ([dest (in-list (reachable-destinations start dests minutes-left))])
-       (match-define (cons valve minutes) dest)
-       (define dests* (hash-remove dests valve))
-       (define next-valves (possible-paths valve dests* (- minutes-left minutes)))
-       (append (list (list dest)) (map (cons dest _) next-valves) path))]))
-
-(define (flow-for-path path minutes [sum 0])
-  (match path
-    ['() sum]
-    [(list* (cons valve dist) tail)
-     (define valve-open-for (- minutes dist 1))
-     (flow-for-path tail valve-open-for (+ sum (* (hash-ref valve-flows valve) valve-open-for)))]))
-
-(define minutes-left 26)
-
-(define human-paths
-  (~>> (possible-paths "AA" valve-flows minutes-left)
-       (map (λ (path) (cons (flow-for-path path minutes-left) (map car path))))
-       (sort _ > #:key car)))
-
-(define (best-possible-elephant-path human-path)
-  (define remaining-dests
-    (for/hash ([(dest flow) (in-hash valve-flows)] #:unless (member dest (cdr human-path)))
-      (values dest flow)))
-  (~>> (possible-paths "AA" remaining-dests minutes-left)
-       (map (λ (path) (cons (flow-for-path path minutes-left) (map car path))))
-       (sort _ > #:key car)
-       car))
-
-;; this takes a long time to run but I stuck a displayln in for debugging
-;; and just took the highest max-flow after letting it run for a while and waiting until
-;; it stopped printing new bests to console
-(for*/fold ([max-flow 0])
-           ([human-path (in-list human-paths)]
-            #:do [(define elephant-path (best-possible-elephant-path human-path))])
-  (define combined-flow (+ (car human-path) (car elephant-path)))
-  (if (< max-flow combined-flow) combined-flow max-flow))