clyne
/
advent-of-code
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

day23: some cleanup

Browse Source
master
Clyne 3 years ago
parent d13c4e6b07
commit 7bf455637f
1 changed files with 17 additions and 14 deletions
Show Stats Download Patch File Download Diff File

31
day23/core.clj
Unescape Escape View File

@ -22,25 +22,29 @@
nil nil
nil]) nil])
(defn do-slot [[field q s] idx] (defn do-slot [[field energy] idx]
(let [slot (get field idx)] (let [slot (get field idx)]
(cond (cond
; Moving value out of a room ; Moving value out of a room
(and (seq? slot) (not (empty? slot)) (not (every? #(= % ({2 :a 4 :b 6 :c 8 :d} idx)) slot))) (and (seq? slot)
(not (empty? slot))
(not (every? #(= % ({2 :a 4 :b 6 :c 8 :d} idx)) slot)))
(let [open-slots (let [open-slots
(filterv (filterv
#(contains? #{0 1 3 5 7 9 10} %) #(contains? #{0 1 3 5 7 9 10} %)
(concat (concat
(for [i (reverse (range 0 idx)) :while (or (nil? (get field i)) (seq? (get field i)))] i) (for [i (reverse (range 0 idx))
(for [i (range idx (count field)) :while (or (nil? (get field i)) (seq? (get field i)))] i)))] :while (or (nil? (get field i)) (seq? (get field i)))] i)
(for [i (range idx (count field))
:while (or (nil? (get field i)) (seq? (get field i)))] i)))]
(when-not (empty? open-slots) (when-not (empty? open-slots)
(map (map
(fn [os] (fn [os]
[(-> field [(-> field
(assoc os (first slot)) (assoc os (first slot))
(update idx rest)) (update idx rest))
(conj q [idx os]) (+ energy (* ({:a 1 :b 10 :c 100 :d 1000} (first slot))
(+ s (* ({:a 1 :b 10 :c 100 :d 1000} (first slot)) (+ (inc (- 4 (count slot))) (Math/abs (- os idx)))))]) (+ (inc (- 4 (count slot))) (Math/abs (- os idx)))))])
open-slots))) open-slots)))
; Moving value into a room ; Moving value into a room
(and (not (seq? slot)) (some? slot)) (and (not (seq? slot)) (some? slot))
@ -52,8 +56,8 @@
[(-> field [(-> field
(assoc idx nil) (assoc idx nil)
(update our-room conj slot)) (update our-room conj slot))
(conj q [idx our-room]) (+ energy (* ({:a 1 :b 10 :c 100 :d 1000} slot)
(+ s (* ({:a 1 :b 10 :c 100 :d 1000} slot) (+ (Math/abs (- idx our-room)) (- 4 (count room)))))]))))))) (+ (Math/abs (- idx our-room)) (- 4 (count room)))))])))))))
(defn winner? [[field q s]] (defn winner? [[field q s]]
(= field (= field
@ -72,7 +76,6 @@
(defn do-turns [fields] (defn do-turns [fields]
(into [] (into []
(r/fold (r/fold
1024
r/cat r/cat
#(if-let [t (apply do-slot %2)] #(if-let [t (apply do-slot %2)]
(if (seq? t) (if (seq? t)
@ -85,24 +88,24 @@
(defn play-games [turns tc] (defn play-games [turns tc]
(println "Games:" (count turns) "Turn:" tc) (println "Games:" (count turns) "Turn:" tc)
(if (< 500000 (count turns)) (if (< 250000 (count turns))
(do (do
(println "Splitting...") (println "Splitting...")
(doseq [p (partition 100000 turns) (doseq [p (partition 50000 turns)]
:let [r (play-games (into [] p) tc)]] nil)) (play-games (into [] p) tc)))
(do (do
(let [new-turns (do-turns turns) (let [new-turns (do-turns turns)
winners (filter winner? new-turns)] winners (filter winner? new-turns)]
(if (pos? (count winners)) (if (pos? (count winners))
(do (do
(println "Winner! Turns:" tc) (println "Winner! Turns:" tc)
(swap! wins #(reduce conj % (map last winners)))) (swap! wins #(reduce conj % (map second winners))))
(when (pos? (count new-turns)) (when (pos? (count new-turns))
(recur new-turns (inc tc)))))))) (recur new-turns (inc tc))))))))
(defn -main (defn -main
"I don't do a whole lot ... yet." "I don't do a whole lot ... yet."
[& args] [& args]
(play-games [[init-field [] 0]] 0) (play-games [[init-field 0]] 0)
(println (first (sort @wins)))) (println (first (sort @wins))))

Write Preview
Loading…
Cancel
Save