day07 part 1

Author: laco

.idea/libraries/Leiningen__org_clojure_math_combinatorics_0_1_6.xml

@@ -17,6 +17,7 @@
     <orderEntry type="library" name="Leiningen: nrepl:0.6.0" level="project" />
     <orderEntry type="library" name="Leiningen: org.clojure/clojure:1.10.1" level="project" />
     <orderEntry type="library" name="Leiningen: org.clojure/core.specs.alpha:0.2.44" level="project" />
+    <orderEntry type="library" name="Leiningen: org.clojure/math.combinatorics:0.1.6" level="project" />
     <orderEntry type="library" name="Leiningen: org.clojure/math.numeric-tower:0.0.4" level="project" />
     <orderEntry type="library" name="Leiningen: org.clojure/spec.alpha:0.2.176" level="project" />
   </component>

clj-adventofcode-2019.iml

@@ -5,6 +5,7 @@
             :url "http://www.eclipse.org/legal/epl-v10.html"}
   :dependencies [[org.clojure/clojure "1.10.1"]
                  [org.clojure/math.numeric-tower "0.0.4"]
+                 [org.clojure/math.combinatorics "0.1.6"]
                  ]
   :main ^:skip-aot clj-adventofcode-2019.core
   :target-path "target/%s"

project.clj

@@ -0,0 +1 @@
+3,8,1001,8,10,8,105,1,0,0,21,46,63,76,97,118,199,280,361,442,99999,3,9,102,4,9,9,101,2,9,9,1002,9,5,9,101,4,9,9,102,2,9,9,4,9,99,3,9,101,5,9,9,102,3,9,9,101,3,9,9,4,9,99,3,9,1001,9,2,9,102,3,9,9,4,9,99,3,9,1002,9,5,9,101,4,9,9,1002,9,3,9,101,2,9,9,4,9,99,3,9,1002,9,5,9,101,3,9,9,1002,9,5,9,1001,9,5,9,4,9,99,3,9,102,2,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,1002,9,2,9,4,9,3,9,1001,9,1,9,4,9,3,9,101,1,9,9,4,9,3,9,1001,9,1,9,4,9,3,9,1002,9,2,9,4,9,3,9,1001,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,102,2,9,9,4,9,99,3,9,1002,9,2,9,4,9,3,9,101,2,9,9,4,9,3,9,1001,9,1,9,4,9,3,9,101,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,1002,9,2,9,4,9,3,9,101,2,9,9,4,9,3,9,1001,9,1,9,4,9,3,9,102,2,9,9,4,9,99,3,9,102,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,101,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,101,1,9,9,4,9,99,3,9,1002,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,1001,9,1,9,4,9,3,9,1001,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,101,1,9,9,4,9,3,9,1001,9,1,9,4,9,3,9,101,2,9,9,4,9,99,3,9,101,1,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,101,1,9,9,4,9,3,9,101,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,101,2,9,9,4,9,99

resources/day07_input.txt

@@ -0,0 +1,91 @@
+(ns clj-adventofcode-2019.day07
+  (:require
+    [clj-adventofcode-2019.day05 :as day05]
+    [clojure.math.numeric-tower :as math]
+    [clojure.math.combinatorics :as combinatorics]
+    [clojure.java.io :as io]))
+
+;--- Day 7: Amplification Circuit ---
+;Based on the navigational maps, you're going to need to send more power to your ship's thrusters to reach Santa in time. To do this, you'll need to configure a series of amplifiers already installed on the ship.
+;
+;There are five amplifiers connected in series; each one receives an input signal and produces an output signal. They are connected such that the first amplifier's output leads to the second amplifier's input, the second amplifier's output leads to the third amplifier's input, and so on. The first amplifier's input value is 0, and the last amplifier's output leads to your ship's thrusters.
+;
+;O-------O  O-------O  O-------O  O-------O  O-------O
+;0 ->| Amp A |->| Amp B |->| Amp C |->| Amp D |->| Amp E |-> (to thrusters)
+;O-------O  O-------O  O-------O  O-------O  O-------O
+;The Elves have sent you some Amplifier Controller Software (your puzzle input), a program that should run on your existing Intcode computer. Each amplifier will need to run a copy of the program.
+;
+;When a copy of the program starts running on an amplifier, it will first use an input instruction to ask the amplifier for its current phase setting (an integer from 0 to 4). Each phase setting is used exactly once, but the Elves can't remember which amplifier needs which phase setting.
+;
+;The program will then call another input instruction to get the amplifier's input signal, compute the correct output signal, and supply it back to the amplifier with an output instruction. (If the amplifier has not yet received an input signal, it waits until one arrives.)
+;
+;Your job is to find the largest output signal that can be sent to the thrusters by trying every possible combination of phase settings on the amplifiers. Make sure that memory is not shared or reused between copies of the program.
+;
+;For example, suppose you want to try the phase setting sequence 3,1,2,4,0, which would mean setting amplifier A to phase setting 3, amplifier B to setting 1, C to 2, D to 4, and E to 0. Then, you could determine the output signal that gets sent from amplifier E to the thrusters with the following steps:
+;
+;Start the copy of the amplifier controller software that will run on amplifier A. At its first input instruction, provide it the amplifier's phase setting, 3. At its second input instruction, provide it the input signal, 0. After some calculations, it will use an output instruction to indicate the amplifier's output signal.
+;Start the software for amplifier B. Provide it the phase setting (1) and then whatever output signal was produced from amplifier A. It will then produce a new output signal destined for amplifier C.
+;Start the software for amplifier C, provide the phase setting (2) and the value from amplifier B, then collect its output signal.
+;Run amplifier D's software, provide the phase setting (4) and input value, and collect its output signal.
+;Run amplifier E's software, provide the phase setting (0) and input value, and collect its output signal.
+;The final output signal from amplifier E would be sent to the thrusters. However, this phase setting sequence may not have been the best one; another sequence might have sent a higher signal to the thrusters.
+;
+;Here are some example programs:
+;
+;Max thruster signal 43210 (from phase setting sequence 4,3,2,1,0):
+;
+;3,15,3,16,1002,16,10,16,1,16,15,15,4,15,99,0,0
+
+
+;Max thruster signal 54321 (from phase setting sequence 0,1,2,3,4):
+;
+;3,23,3,24,1002,24,10,24,1002,23,-1,23,
+;101,5,23,23,1,24,23,23,4,23,99,0,0
+
+
+;Max thruster signal 65210 (from phase setting sequence 1,0,4,3,2):
+;
+;3,31,3,32,1002,32,10,32,1001,31,-2,31,1007,31,0,33,
+;1002,33,7,33,1,33,31,31,1,32,31,31,4,31,99,0,0,0
+;Try every combination of phase settings on the amplifiers. What is the highest signal that can be sent to the thrusters?
+
+(def data-file (io/resource "day07_input.txt"))
+(def the-program
+  (apply vector (map #(Integer/parseInt (clojure.string/trim-newline %))
+                     (clojure.string/split
+                       (slurp data-file) #","))))
+
+(day05/execute-program-v2 the-program [3 0] [])
+
+(defn execute-phase-seq-on-amplifiers [phase-seq program]
+  (let [
+        [_ _ amp-A-outputs ] (day05/execute-program-v2 program [(nth phase-seq 0) 0] [])
+        [_ _ amp-B-outputs ] (day05/execute-program-v2 program [(nth phase-seq 1) (first amp-A-outputs)] [])
+        [_ _ amp-C-outputs ] (day05/execute-program-v2 program [(nth phase-seq 2) (first amp-B-outputs)] [])
+        [_ _ amp-D-outputs ] (day05/execute-program-v2 program [(nth phase-seq 3) (first amp-C-outputs)] [])
+        [_ _ amp-E-outputs ] (day05/execute-program-v2 program [(nth phase-seq 4) (first amp-D-outputs)] [])
+        ]
+    (first amp-E-outputs)
+    ))
+
+(assert (= 43210
+           (execute-phase-seq-on-amplifiers [4,3,2,1,0] [3,15,3,16,1002,16,10,16,1,16,15,15,4,15,99,0,0])))
+
+(assert (= 54321 (execute-phase-seq-on-amplifiers [0,1,2,3,4] [3,23,3,24,1002,24,10,24,1002,23,-1,23,
+                                                               101,5,23,23,1,24,23,23,4,23,99,0,0])))
+
+(assert (= 65210 (execute-phase-seq-on-amplifiers [1,0,4,3,2] [3,31,3,32,1002,32,10,32,1001,31,-2,31,1007,31,0,33,
+                                                               1002,33,7,33,1,33,31,31,1,32,31,31,4,31,99,0,0,0])))
+
+
+
+(defn find-max-thruster-signal [program]
+  (first
+    (sort-by
+      (fn [[_ v]] (* -1 v))
+      (map (fn [combination]
+             [combination
+              (execute-phase-seq-on-amplifiers combination program)])
+           (combinatorics/permutations [0 1 2 3 4])))))
+
+(def part1-solution (find-max-thruster-signal the-program))