Cleanup of prints & useless racetrack module

Author: Piratmac

2018/11-Chronal Charge.py

@@ -4,68 +4,100 @@
 test_data = {}
 
 test = 1
-test_data[test]   = {"input": 18,
-                     "expected": ['Unknown', 'Unknown'],
-                    }
-
-test = 'real'
-input_file = os.path.join(os.path.dirname(__file__), 'Inputs', os.path.basename(__file__).replace('.py', '.txt'))
-test_data[test] = {"input": 7165,
-                     "expected": ['(235, 20) with 31', '(237, 223, 14) with 83'],
-                    }
+test_data[test] = {
+    "input": 18,
+    "expected": ["Unknown", "Unknown"],
+}
+
+test = "real"
+input_file = os.path.join(
+    os.path.dirname(__file__),
+    "Inputs",
+    os.path.basename(__file__).replace(".py", ".txt"),
+)
+test_data[test] = {
+    "input": 7165,
+    "expected": ["(235, 20) with 31", "(237, 223, 14) with 83"],
+}
 
 # -------------------------------- Control program execution -------------------------------- #
 
-case_to_test = 'real'
+case_to_test = "real"
 part_to_test = 2
 
 # -------------------------------- Initialize some variables -------------------------------- #
 
-puzzle_input           = test_data[case_to_test]['input']
-puzzle_expected_result = test_data[case_to_test]['expected'][part_to_test-1]
-puzzle_actual_result   = 'Unknown'
+puzzle_input = test_data[case_to_test]["input"]
+puzzle_expected_result = test_data[case_to_test]["expected"][part_to_test - 1]
+puzzle_actual_result = "Unknown"
 
 
 # -------------------------------- Actual code execution -------------------------------- #
 
 
 if part_to_test == 1:
-    grid_power = {(x, y): int(((((10+x)*y + puzzle_input) * (10+x)) // 100) % 10)-5 for x in range (1, 301) for y in range (1, 301)}
-
-    sum_power = {(x, y): sum(grid_power[x1, y1] for x1 in range (x, x+3) for y1 in range (y, y+3)) for x in range (1, 299) for y in range (1, 299)}
+    grid_power = {
+        (x, y): int(((((10 + x) * y + puzzle_input) * (10 + x)) // 100) % 10) - 5
+        for x in range(1, 301)
+        for y in range(1, 301)
+    }
+
+    sum_power = {
+        (x, y): sum(
+            grid_power[x1, y1] for x1 in range(x, x + 3) for y1 in range(y, y + 3)
+        )
+        for x in range(1, 299)
+        for y in range(1, 299)
+    }
 
     max_power = max(sum_power.values())
 
-    puzzle_actual_result = list(coord for coord in sum_power if sum_power[coord] == max_power)
+    puzzle_actual_result = list(
+        coord for coord in sum_power if sum_power[coord] == max_power
+    )
 
 
 else:
-    grid_power = {(x, y): int(((((10+x)*y + puzzle_input) * (10+x)) // 100) % 10)-5 for x in range (1, 301) for y in range (1, 301)}
+    grid_power = {
+        (x, y): int(((((10 + x) * y + puzzle_input) * (10 + x)) // 100) % 10) - 5
+        for x in range(1, 301)
+        for y in range(1, 301)
+    }
 
     max_power = 31
     sum_power = grid_power.copy()
-    for size in range (2, 300):
-        sum_power = {(x, y, size): sum(grid_power[x1, y1]
-                                       for x1 in range (x, x+size)
-                                       for y1 in range (y, y+size))
-                     for x in range (1, 301-size+1)
-                     for y in range (1, 301-size+1)}
+    decreasing = False
+    last_power = 0
+    for size in range(2, 300):
+        sum_power = {
+            (x, y, size): sum(
+                grid_power[x1, y1]
+                for x1 in range(x, x + size)
+                for y1 in range(y, y + size)
+            )
+            for x in range(1, 301 - size + 1)
+            for y in range(1, 301 - size + 1)
+        }
 
         new_max = max(sum_power.values())
         if new_max > max_power:
+            decreasing = False
             max_power = new_max
-            puzzle_actual_result = list(coord + (size,) for coord in sum_power if sum_power[coord] == max_power)
+            puzzle_actual_result = list(
+                coord for coord in sum_power if sum_power[coord] == max_power
+            )
 
         # Basically, let it run until it decreases multiple times
-        print (size, new_max, list(coord for coord in sum_power if sum_power[coord] == new_max))
+        # print (size, new_max, list(coord for coord in sum_power if sum_power[coord] == new_max))
 
+        if not decreasing and new_max < last_power:
+            decreasing = True
+        elif decreasing and new_max < last_power:
+            break
+        last_power = new_max
 
 
 # -------------------------------- Outputs / results -------------------------------- #
 
-print ('Expected result : ' + str(puzzle_expected_result))
-print ('Actual result   : '   + str(puzzle_actual_result))
-
-
-
-
+print("Expected result : " + str(puzzle_expected_result))
+print("Actual result   : " + str(puzzle_actual_result))

2018/12-Subterranean Sustainability.py

@@ -4,7 +4,8 @@
 test_data = {}
 
 test = 1
-test_data[test]   = {"input": '''initial state: #..#.#..##......###...###
+test_data[test] = {
+    "input": """initial state: #..#.#..##......###...###
 
 ...## => #
 ..#.. => #
@@ -19,26 +20,31 @@
 ##.## => #
 ###.. => #
 ###.# => #
-####. => #''',
-                     "expected": ['325', 'Unknown'],
-                    }
-
-test = 'real'
-input_file = os.path.join(os.path.dirname(__file__), 'Inputs', os.path.basename(__file__).replace('.py', '.txt'))
-test_data[test] = {"input": open(input_file, "r+").read().strip(),
-                     "expected": ['3890', '23743'],
-                    }
+####. => #""",
+    "expected": ["325", "Unknown"],
+}
+
+test = "real"
+input_file = os.path.join(
+    os.path.dirname(__file__),
+    "Inputs",
+    os.path.basename(__file__).replace(".py", ".txt"),
+)
+test_data[test] = {
+    "input": open(input_file, "r+").read().strip(),
+    "expected": ["3890", "23743"],
+}
 
 # -------------------------------- Control program execution -------------------------------- #
 
-case_to_test = 'real'
+case_to_test = "real"
 part_to_test = 2
 
 # -------------------------------- Initialize some variables -------------------------------- #
 
-puzzle_input           = test_data[case_to_test]['input']
-puzzle_expected_result = test_data[case_to_test]['expected'][part_to_test-1]
-puzzle_actual_result   = 'Unknown'
+puzzle_input = test_data[case_to_test]["input"]
+puzzle_expected_result = test_data[case_to_test]["expected"][part_to_test - 1]
+puzzle_actual_result = "Unknown"
 
 
 # -------------------------------- Actual code execution -------------------------------- #
@@ -53,35 +59,41 @@
 
 initial_state = puzzle_input.splitlines()[0][15:]
 
-pots = np.full((len(initial_state) + 10**6), '.')
-pots[5*10**5:5*10**5+len(initial_state)] = np.fromiter(initial_state, dtype='S1', count=len(initial_state))
+pots = np.full((len(initial_state) + 10 ** 6), ".")
+pots[5 * 10 ** 5 : 5 * 10 ** 5 + len(initial_state)] = np.fromiter(
+    initial_state, dtype="S1", count=len(initial_state)
+)
 
 rules = {}
 for string in puzzle_input.splitlines()[2:]:
-    source, target = string.split(' => ')
+    source, target = string.split(" => ")
     rules[source] = target
 
-prev_sum = sum(np.where(pots == '#')[0]) - 5*10**5 * len(np.where(pots == '#')[0])
-for i in range (1, generations):
+prev_sum = sum(np.where(pots == "#")[0]) - 5 * 10 ** 5 * len(np.where(pots == "#")[0])
+for i in range(1, generations):
 
     if case_to_test == 1:
-        for i in range (2, len(pots)-3):
-            if ''.join(pots[i-2:i+3]) not in rules:
-                rules[''.join(pots[i-2:i+3])] = '.'
+        for i in range(2, len(pots) - 3):
+            if "".join(pots[i - 2 : i + 3]) not in rules:
+                rules["".join(pots[i - 2 : i + 3])] = "."
 
-    min_x, max_x = min(np.where(pots == '#')[0]), max(np.where(pots == '#')[0])
+    min_x, max_x = min(np.where(pots == "#")[0]), max(np.where(pots == "#")[0])
 
-    new_pots = np.full((len(initial_state) + 10**6), '.')
-    new_pots[min_x-2:max_x+2] = [rules[''.join(pots[i-2:i+3])] for i in range(min_x-2, max_x+2)]
+    new_pots = np.full((len(initial_state) + 10 ** 6), ".")
+    new_pots[min_x - 2 : max_x + 2] = [
+        rules["".join(pots[i - 2 : i + 3])] for i in range(min_x - 2, max_x + 2)
+    ]
     pots = new_pots.copy()
 
-    sum_pots = sum(np.where(new_pots == '#')[0]) - 5*10**5 * len(np.where(new_pots == '#')[0])
+    sum_pots = sum(np.where(new_pots == "#")[0]) - 5 * 10 ** 5 * len(
+        np.where(new_pots == "#")[0]
+    )
 
-    print (i, sum_pots, sum_pots - prev_sum)
+    # print (i, sum_pots, sum_pots - prev_sum)
     prev_sum = sum_pots
 
     if i == 200:
-        puzzle_actual_result = sum_pots + 96 * (generations-200)
+        puzzle_actual_result = sum_pots + 96 * (generations - 200)
         break
 
 if part_to_test == 1:
@@ -90,9 +102,5 @@
 
 # -------------------------------- Outputs / results -------------------------------- #
 
-print ('Expected result : ' + str(puzzle_expected_result))
-print ('Actual result   : '   + str(puzzle_actual_result))
-
-
-
-
+print("Expected result : " + str(puzzle_expected_result))
+print("Actual result   : " + str(puzzle_actual_result))