Start Day 13

Author: Björn Walter

11.py

@@ -20,7 +20,8 @@ def expand_universe(uni):
 
     return uni
 
-def min_dist(uni, source, )
+def min_dist(uni, source, destination):
+    return
 
 def main():
     with open("inputs/11_test.txt", "r") as file:

12.py

@@ -0,0 +1,57 @@
+import numpy as np
+
+class Record():
+    def __init__(self, line):
+        self.condition = line[0]
+        self.criteria = [int(item) for item in line[1].split(",")]
+        #print(self.criteria)
+
+def get_combinations(cond):
+    idx = cond.find("?")
+
+    if idx == -1:
+        combination = []
+        count = 0
+        for idx, i in enumerate(cond):
+            if i == "#":
+                count += 1
+            if i == ".":
+                if count != 0:
+                    combination.append(count)
+                count = 0
+            if idx == len(cond)-1 and count != 0:
+                combination.append(count)
+                
+        return [combination]
+    
+    option1 = cond[:idx] + "#" + cond[idx +1:]
+    option2 = cond[:idx] + "." + cond[idx +1:]
+
+    combinations1 = get_combinations(option1)
+    combinations2 = get_combinations(option2)
+
+    return combinations1 + combinations2    
+
+def find_arr(rec):
+    combs = get_combinations(rec.condition)
+    arr = 0
+    for comb in combs:
+        if comb == rec.criteria:
+            arr += 1
+    return arr
+
+def main():
+    with open("inputs/12.txt", "r") as file:
+        lines = file.readlines()
+    
+    records = [Record(line.strip("\n").split()) for line in lines]
+    arrs = []
+    for record in records:
+        arrs.append(find_arr(record))
+    print(arrs)
+    print(sum(arrs))
+
+    #universe = np.array([[e for e in line.strip("\n")] for line in lines])
+
+if __name__ == "__main__":
+    main()

13.py

@@ -0,0 +1,35 @@
+import numpy as np
+
+
+def find_symmetry(pattern):
+    #horizontal
+    for i, row in enumerate(pattern):
+        top = pattern[:i]
+        bottom = np.flip(pattern[i:i*2], axis=0)
+        if np.array_equal(top, bottom) and i != 0:
+            return i, "horizontal"
+    for j, _ in enumerate(pattern[0]):
+        left = pattern[:,:j]
+        right = np.flip(pattern[:, j:j*2], axis=0)
+        print(left, right)
+        if np.array_equal(left, right) and j != 0:
+            return j, "vertical"
+
+
+def main():
+    with open("inputs/13_test.txt", "r") as file:
+        lines = file.readlines()
+    patterns = []
+    pattern = []
+    for i, line in enumerate(lines):
+        if line == "\n" or i == len(lines)-1:
+            patterns.append(np.array([list(map(str, row)) for row in pattern]))
+            pattern = []
+        else:
+            pattern.append(line.strip("\n"))
+    find_symmetry(patterns[0])
+        
+    
+    #print(patterns)
+if __name__ == "__main__":
+    main()

7.py

@@ -53,9 +53,6 @@ def compare_hands(self, hand):
         else:
             return False
 
-        
-    
-
 def main():
     with open("inputs/7_test.txt", "r") as file:
         lines = file.readlines()
@@ -65,10 +62,18 @@ def main():
         hands.append(Hand(game))
     ranking = []
     for hand in hands:
-        for idx, rank in enumerate(ranking):
-            if hand.compare_hands(rank) == -1:
-                ranking.insert(idx, hand)
-                break
+        if len(ranking) == 0:
+            ranking.append(hand)
+        else:
+            for idx, rank in enumerate(ranking):
+                if hand.compare_hands(rank) == False:
+                    ranking = ranking[:idx] + [hand] + ranking[idx:]
+                    #ranking.insert(idx, hand)
+                    break
+                if idx == len(ranking)-1:
+                    ranking.append(hand)
+    for rank in ranking:
+        print(rank.cards)
 
 
 if __name__ == "__main__":