From 638d85641718b949dfc652b171a27d8ed5d30b6f Mon Sep 17 00:00:00 2001
From: Maya Herrscher <maya.herrscher@uni-hamburg.de>
Date: Tue, 17 Dec 2024 12:57:54 +0100
Subject: [PATCH] Solution for Day 17, part 2 input specific

---
 2024/day17/__pycache__/code.cpython-313.pyc | Bin 0 -> 2581 bytes
 2024/day17/challenge                        |  82 ++++++++++++++++++++
 2024/day17/code.py                          |  79 +++++++++++++++++++
 2024/day17/example                          |   5 ++
 2024/day17/example1                         |   5 ++
 2024/day17/example2                         |   5 ++
 2024/day17/example3                         |   5 ++
 2024/day17/input                            |  20 +++++
 8 files changed, 201 insertions(+)
 create mode 100644 2024/day17/__pycache__/code.cpython-313.pyc
 create mode 100644 2024/day17/challenge
 create mode 100755 2024/day17/code.py
 create mode 100644 2024/day17/example
 create mode 100644 2024/day17/example1
 create mode 100644 2024/day17/example2
 create mode 100644 2024/day17/example3
 create mode 100644 2024/day17/input

diff --git a/2024/day17/__pycache__/code.cpython-313.pyc b/2024/day17/__pycache__/code.cpython-313.pyc
new file mode 100644
index 0000000000000000000000000000000000000000..b3196a73fe21ad337cacf81531ad47e021de8161
GIT binary patch
literal 2581
zcmbVMO>7fK6rR~#ukH0;oFB*^VB(146yrD~1*QDu2WY8?6K_o-SSi{#j^iq^-B||+
zEvhS2)rN`~Au2~b;M}NsDBN192h?6TCUUAes~jrz<XcD%6+QLM+D=T0P{l|)JMVjM
z-uvFXH?w822ndE{NDljXg#MyJWf;nft+Nb550QvO{1GChKPFg{8NzrFVMV4H5l&=b
z)=9j`^^PGV|AUaEZ$lFD*Hm2Y{6(D(gdSW%{B=8;%BrWlAcBPbdn)M8zYU4JB=i6`
zI*3`aKrFMUul8HU46nhA)tJH(E3uIp*e_7r@6?>WGKr=N+d6a^DUi3qd|*N-ifEL;
zb}qxrB@03(<N$pXky;Uvy8TG1lj?zAZN*3LFK|MTy>FkSqqtN@<I=yVbHhrLtddQt
zk?MM&GIY#wkf+9z)LrTT>jv1V+4Qg_3kMQSe!6|vkXYc1t2kq6FL1^cHm`8rMoA-$
zAeyB{D-tco*orkov63cDXOo(&=oqu33F9!tDdj!|C!nqH6mr!RDW{=ex#Ai@%9?&#
zM`3!1u4*8i{1n|ac23xV!pMb(T#U-b<`OC|$K#>sqzkJ!qEPn^wc9ftn+<tp<$2i?
zjwIYlVs2{6(>Hl76ixW124a&TPgiGGw`WqG_a65IK|UIvS9$OjpGy$h_(u2?s3S_E
zb(a6S_siat{MD%~08p@84!YLtv=j{5B?;gtAHX7hA5=12tubeS^RR$0ZjfkEH9f0c
z5ZEDdQU2=ok&NN7iLvg0u18N@Ln6>tqE54IL+EO`)!}%c5q1wKCnNF!-VN;C(3X{w
zM45n2<lT@;ROkB<{OL7+l$+OW29&MRKLS0k>A^#Q7Y%O6^%aYIU}4lOY+%6vyX%lC
zoB(95^L<g}YaT3_?O5Iai4_68py}%&w{pfiQ7il%sLH1g_L#IiZ+{-u`Mv}GO0_un
z*5}LZ@EdcEo$Kb>k;^>fVvDp$MOyMAZ5RS4ii$K%Rd>$s_xTAeXHlDI0~Bf36=^FG
zs0t#q_gtK+i<3w+p>nfwVp`QD$Xqn2^`}b@%^we{Of0T4M22qyzMzWZDjST&6&lD<
z8l)675>*m}><65>R=OZ)5)}k<a-g6$rbchy%KCF%*^4>y_~24vrS(WANb!-|*E8V^
zyUrO?&djlFf39zpJ5<mMDf#w|b&GxB%AG4&COeX27cVcG@|N}#Q!v1;G@r%=qd9}`
zHWn<l^yus0nvD0g3X>&czk9q;Q=9Jl(+unM`E=i#eXSd;DJ3(KzW$AEcl7_q@r_m~
zTmVX4sZ+~bBcbntY8W4%l_SydabgGY=CnT)jwp!`arE^%4xbr5N#xVg<hw2@x~=Fh
zD<*a;2Fi+HSs_J-Ni0m{*%BTH;q+l}cI1q!!$q1P9BHOg3+2I4wTh42v;?Q+nVC>D
z9CCPj1r-Y_s>Zr{1y{4mD)S2TNQg902edo2PSRR}rWBQDL*wHr7lYSS<zy1Rrg9`C
zPpT}mj>;<`nFOa*9Hw$&Hx-={pNS-hgVNH+V_*>?Dhred+-_j{2|&OgL8wo~tIb_5
zhO|;Gjw$pWbas|n)o^k)HaRyFI!)dKlwJ;H6y^;UWBfOda6=x|Z}3QOOtPCi#`aCa
z0o=6Fj}d21-ORI1YXY>x!j1HeEKYxx7h3)h94mq&FSJ3c8-xYp9piHCtqp|EG6M{}
z=*B@N*|%n|&x~Xe_eUSJE-E>1?&GE7-+lhQ_{9FC`{~{vq~yh9e~L-<7h3marxrha
z<XiMT9$0Pd%$vL`t(}=q(*qfN?>sD5Oy1;R!D>rhC<xYqsrG&_+x{SuHyy||tnGK^
z1|RQTy7Z*`C;c=0v+?PfXZ_Ea=l#pWqxt<~D~1*tA;V-YywD+&?FEl?LaHq_k!f4y
z8X#Y@ZQ(@v#FCh=cP)uId|%AkzrDO9uGG8orjF#`8eGw#Y<Kohj#(C*t6V$XVy(iL
og@eCyZ5vL+HNV_6AamEt%^K9uq0r~%SEGG!5BHnXKG<UT7mes9KL7v#

literal 0
HcmV?d00001

diff --git a/2024/day17/challenge b/2024/day17/challenge
new file mode 100644
index 0000000..272a6d3
--- /dev/null
+++ b/2024/day17/challenge
@@ -0,0 +1,82 @@
+--- Day 17: Chronospatial Computer ---
+
+The Historians push the button on their strange device, but this time, you all just feel like you're falling.
+
+"Situation critical", the device announces in a familiar voice. "Bootstrapping process failed. Initializing debugger...."
+
+The small handheld device suddenly unfolds into an entire computer! The Historians look around nervously before one of them tosses it to you.
+
+This seems to be a 3-bit computer: its program is a list of 3-bit numbers (0 through 7), like 0,1,2,3. The computer also has three registers named A, B, and C, but these registers aren't limited to 3 bits and can instead hold any integer.
+
+The computer knows eight instructions, each identified by a 3-bit number (called the instruction's opcode). Each instruction also reads the 3-bit number after it as an input; this is called its operand.
+
+A number called the instruction pointer identifies the position in the program from which the next opcode will be read; it starts at 0, pointing at the first 3-bit number in the program. Except for jump instructions, the instruction pointer increases by 2 after each instruction is processed (to move past the instruction's opcode and its operand). If the computer tries to read an opcode past the end of the program, it instead halts.
+
+So, the program 0,1,2,3 would run the instruction whose opcode is 0 and pass it the operand 1, then run the instruction having opcode 2 and pass it the operand 3, then halt.
+
+There are two types of operands; each instruction specifies the type of its operand. The value of a literal operand is the operand itself. For example, the value of the literal operand 7 is the number 7. The value of a combo operand can be found as follows:
+
+    Combo operands 0 through 3 represent literal values 0 through 3.
+    Combo operand 4 represents the value of register A.
+    Combo operand 5 represents the value of register B.
+    Combo operand 6 represents the value of register C.
+    Combo operand 7 is reserved and will not appear in valid programs.
+
+The eight instructions are as follows:
+
+The adv instruction (opcode 0) performs division. The numerator is the value in the A register. The denominator is found by raising 2 to the power of the instruction's combo operand. (So, an operand of 2 would divide A by 4 (2^2); an operand of 5 would divide A by 2^B.) The result of the division operation is truncated to an integer and then written to the A register.
+
+The bxl instruction (opcode 1) calculates the bitwise XOR of register B and the instruction's literal operand, then stores the result in register B.
+
+The bst instruction (opcode 2) calculates the value of its combo operand modulo 8 (thereby keeping only its lowest 3 bits), then writes that value to the B register.
+
+The jnz instruction (opcode 3) does nothing if the A register is 0. However, if the A register is not zero, it jumps by setting the instruction pointer to the value of its literal operand; if this instruction jumps, the instruction pointer is not increased by 2 after this instruction.
+
+The bxc instruction (opcode 4) calculates the bitwise XOR of register B and register C, then stores the result in register B. (For legacy reasons, this instruction reads an operand but ignores it.)
+
+The out instruction (opcode 5) calculates the value of its combo operand modulo 8, then outputs that value. (If a program outputs multiple values, they are separated by commas.)
+
+The bdv instruction (opcode 6) works exactly like the adv instruction except that the result is stored in the B register. (The numerator is still read from the A register.)
+
+The cdv instruction (opcode 7) works exactly like the adv instruction except that the result is stored in the C register. (The numerator is still read from the A register.)
+
+Here are some examples of instruction operation:
+
+    If register C contains 9, the program 2,6 would set register B to 1.
+    If register A contains 10, the program 5,0,5,1,5,4 would output 0,1,2.
+    If register A contains 2024, the program 0,1,5,4,3,0 would output 4,2,5,6,7,7,7,7,3,1,0 and leave 0 in register A.
+    If register B contains 29, the program 1,7 would set register B to 26.
+    If register B contains 2024 and register C contains 43690, the program 4,0 would set register B to 44354.
+
+The Historians' strange device has finished initializing its debugger and is displaying some information about the program it is trying to run (your puzzle input). For example:
+
+Register A: 729
+Register B: 0
+Register C: 0
+
+Program: 0,1,5,4,3,0
+
+Your first task is to determine what the program is trying to output. To do this, initialize the registers to the given values, then run the given program, collecting any output produced by out instructions. (Always join the values produced by out instructions with commas.) After the above program halts, its final output will be 4,6,3,5,6,3,5,2,1,0.
+
+Using the information provided by the debugger, initialize the registers to the given values, then run the program. Once it halts, what do you get if you use commas to join the values it output into a single string?
+
+Your puzzle answer was 7,1,5,2,4,0,7,6,1.
+--- Part Two ---
+
+Digging deeper in the device's manual, you discover the problem: this program is supposed to output another copy of the program! Unfortunately, the value in register A seems to have been corrupted. You'll need to find a new value to which you can initialize register A so that the program's output instructions produce an exact copy of the program itself.
+
+For example:
+
+Register A: 2024
+Register B: 0
+Register C: 0
+
+Program: 0,3,5,4,3,0
+
+This program outputs a copy of itself if register A is instead initialized to 117440. (The original initial value of register A, 2024, is ignored.)
+
+What is the lowest positive initial value for register A that causes the program to output a copy of itself?
+
+Your puzzle answer was 37222273957364.
+
+Both parts of this puzzle are complete! They provide two gold stars: **
diff --git a/2024/day17/code.py b/2024/day17/code.py
new file mode 100755
index 0000000..df9e123
--- /dev/null
+++ b/2024/day17/code.py
@@ -0,0 +1,79 @@
+#!/usr/bin/env python3
+
+import sys, re, math
+
+
+out = []
+
+
+def output(i):
+   out.append(i) 
+
+
+def instr(opc, op, ra, rb, rc, p):
+    cop = op
+    if op in [4,5,6]: cop = [ra,rb,rc][op-4]
+    if op == 7: cop = 'ERROR'
+    if opc == 0: # 'adv' instruction
+        ra = math.trunc(ra / 2**cop)
+        p += 2
+    elif opc == 1: # 'bxl' instruction
+        rb = rb ^ op
+        p += 2
+    elif opc == 2: # 'bst' instruction
+        rb = cop % 8
+        p += 2
+    elif opc == 3: # 'jnz' instruction
+        if ra != 0:
+            p = op
+        else:
+            p += 2
+    elif opc == 4: # 'bxc' instruction
+        rb = rb ^ rc
+        p += 2
+    elif opc == 5: # 'out' instruction
+        output(cop % 8)
+        p += 2
+    elif opc == 6: # 'bdv' instruction
+        rb = math.trunc(ra / 2**cop)
+        p += 2
+    elif opc == 7: # 'cdv' instruction
+        rc = math.trunc(ra / 2**cop)
+        p += 2
+    return ra, rb, rc, p
+
+
+def step(lb, ub, i, exp):
+    for ra in range(lb, ub):
+        if (((ra//8**i)%8) ^ 1 ^ int((ra//8**i) / 2**((ra//8** i%8)^2)) % 8) == exp: yield ra
+
+
+if __name__ == '__main__':
+    ins = open(sys.argv[1]).read()
+    g = re.search(r'Register A: (?P<ra>\d+)\nRegister B: (?P<rb>\d+)\nRegister C: (?P<rc>\d+)\n\nProgram: (?P<prog>(\d+,?)*)', ins)
+    ra, rb, rc = int(g['ra']), int(g['rb']), int(g['rc'])
+    prog = [int(p) for p in g['prog'].split(',')]
+    pointer = 0
+    while True:
+        if pointer >= len(prog): break
+        ra, rb, rc, pointer = instr(prog[pointer], prog[pointer+1], ra, rb, rc, pointer)
+    
+    possible_bounds = [(0,8)]
+    for i in range(15,-1,-1):
+        exp = prog[i]
+        possible_x = []
+        for lb, ub in possible_bounds:
+            possible_x += [i for i in step(lb, ub, 0, exp)]
+        possible_bounds = [(x*8,(x+1)*8) for x in possible_x]
+        ra = min(possible_x)
+    
+
+
+    # challenge 1
+    res1 = ','.join([str(o) for o in out])
+    print(f"challenge 1:\n{res1}\n")
+
+    # challenge 2
+    res2 = ra
+    print(f"challenge 2 (only works for my input):\n{res2}")
+
diff --git a/2024/day17/example b/2024/day17/example
new file mode 100644
index 0000000..27625b1
--- /dev/null
+++ b/2024/day17/example
@@ -0,0 +1,5 @@
+Register A: 2024
+Register B: 0
+Register C: 0
+
+Program: 0,1,5,4,3,0
diff --git a/2024/day17/example1 b/2024/day17/example1
new file mode 100644
index 0000000..f69bbc0
--- /dev/null
+++ b/2024/day17/example1
@@ -0,0 +1,5 @@
+Register A: 117440
+Register B: 0
+Register C: 0
+
+Program: 0,3,5,4,3,0
diff --git a/2024/day17/example2 b/2024/day17/example2
new file mode 100644
index 0000000..f09839b
--- /dev/null
+++ b/2024/day17/example2
@@ -0,0 +1,5 @@
+Register A: 729
+Register B: 0
+Register C: 0
+
+Program: 0,1,5,4,3,0
diff --git a/2024/day17/example3 b/2024/day17/example3
new file mode 100644
index 0000000..9b1d816
--- /dev/null
+++ b/2024/day17/example3
@@ -0,0 +1,5 @@
+Register A: 0
+Register B: 2024
+Register C: 43690
+
+Program: 4,0
diff --git a/2024/day17/input b/2024/day17/input
new file mode 100644
index 0000000..1e29ec1
--- /dev/null
+++ b/2024/day17/input
@@ -0,0 +1,20 @@
+Register A: 48744869
+Register B: 0
+Register C: 0
+
+Program: 2,4,1,2,7,5,1,3,4,4,5,5,0,3,3,0
+
+bst ra (rb = ra % 8)
+bxl 2 (rb = rb ^ 2)
+cdv rb (rc = int(ra / 2**rb))
+bxl 3 (rb = rb ^ 3)
+bxc _ (rb = rb ^ rc)
+out rb (print rb % 8)
+adv 3 (ra = int(ra / 8))
+jnz 0 (loop if ra != 0)
+
+print rb%8 = rb^rc % 8 = rb ^ 3 ^ rc % 8 = rb ^ 3 ^ int(ra / 2^rb) % 8 = rb ^ 2 ^ 3 ^ int(ra / 2**(rb^2)) % 8 = 
+    (ra%8) ^ 2 ^ 3 ^ int(ra / 2**((ra%8)^2)) % 8 = 2
+    ((ra//8**1)%8) ^ 2 ^ 3 ^ int((ra//8**1) / 2**((ra%8**1)^2)) % 8 = 4
+-> must loop 16 times, so ra must be around 8^15 to 8^16?
+prints out