Added day 2018-13 (buggy v1 + version with works)

Piratmac · Piratmac · commit c53a5c7dd466 · 2020-06-20T19:01:18.000+02:00
diff --git a/2018/13-Mine Cart Madness.py b/2018/13-Mine Cart Madness.py
@@ -0,0 +1,136 @@
+# -------------------------------- Input data -------------------------------- #
+import os, pathfinding, re
+
+test_data = {}
+
+test = 1
+test_data[test]   = {"input": """/->-\\
+|   |  /----\\
+| /-+--+-\  |
+| | |  | v  |
+\-+-/  \-+--/
+  \------/   """,
+                     "expected": ['7,3', 'Unknown'],
+                    }
+
+test += 1
+test_data[test]   = {"input": r"""/>-<\
+|   |
+| /<+-\
+| | | v
+\>+</ |
+  |   ^
+  \<->/""",
+                     "expected": ['Unknown', '6,4'],
+                    }
+
+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(),
+                     "expected": ['124,130', '143, 123'],
+                    }
+
+# -------------------------------- Control program execution -------------------------------- #
+
+case_to_test = 'real'
+part_to_test = 2
+verbose = 3
+
+# -------------------------------- 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'
+
+
+# -------------------------------- Actual code execution -------------------------------- #
+
+cart_to_track = {'^': '|', '>': '-', '<': '-', 'v': '|'}
+up, right, left, down = ((0, -1), (1, 0), (-1, 0), (0, 1))
+directions = {'^': up, '>': right, '<': left, 'v': down}
+new_dirs = {
+    '^':['<', '^', '>'],
+    '>':['^', '>', 'v'],
+    '<':['v', '<', '^'],
+    'v':['>', 'v', '<'],
+    '/': {'^': '>', '>': '^', '<': 'v', 'v': '<'},
+    '\\':{'^': '<', '>': 'v', '<': '^', 'v': '>'},
+}
+
+
+def move_cart (track, cart):
+    (x, y), dir, choice = cart
+
+    x += directions[dir][0]
+    y += directions[dir][1]
+
+    if track[y][x] == '+':
+        dir = new_dirs[dir][choice]
+        choice += 1
+        choice %= 3
+    elif track[y][x] in ('\\', '/'):
+        dir = new_dirs[track[y][x]][dir]
+
+    return ((x, y), dir, choice)
+
+# Setting up the track
+track = []
+cart_positions = []
+carts = []
+for y, line in enumerate(puzzle_input.split('\n')):
+    track.append([])
+    for x, letter in enumerate(line):
+        if letter in cart_to_track:
+            track[y].append(cart_to_track[letter])
+            carts.append(((x, y), letter, 0))
+            cart_positions.append((x, y))
+        else:
+            track[y].append(letter)
+
+# Run them!
+tick = 0
+
+carts.append('new')
+while len(carts) > 0:
+    cart = carts.pop(0)
+    if cart == 'new':
+        if len(carts) == 1:
+            break
+        tick += 1
+#        print ('tick', tick, 'completed - Remaining', len(carts))
+        carts = sorted(carts, key=lambda x: (x[0][1], x[0][0]))
+        cart_positions = [c[0] for c in carts]
+        cart = carts.pop(0)
+        carts.append('new')
+    cart_positions.pop(0)
+
+
+
+    cart = move_cart(track, cart)
+
+    # Check collisions
+    if cart[0] in cart_positions:
+        if part_to_test == 1:
+            puzzle_actual_result = cart[0]
+            break
+        else:
+            print ('collision', cart[0])
+            carts = [c for c in carts if c[0] != cart[0]]
+            cart_positions = [c[0] for c in carts]
+    else:
+        carts.append(cart)
+        cart_positions.append(cart[0])
+
+if part_to_test == 2:
+    puzzle_actual_result = carts[0][0]
+
+
+
+# -------------------------------- Outputs / results -------------------------------- #
+
+print ('Expected result : ' + str(puzzle_expected_result))
+print ('Actual result   : '   + str(puzzle_actual_result))
+
+
+
+
diff --git a/2018/13-Mine Cart Madness.v1.py b/2018/13-Mine Cart Madness.v1.py
@@ -0,0 +1,211 @@
+
+
+# This v1 works for part 1, not part 2
+# Since it's also quite slow, I've done a v2 that should be better
+
+
+
+
+
+
+# -------------------------------- Input data -------------------------------- #
+import os, pathfinding, re
+
+test_data = {}
+
+test = 1
+test_data[test]   = {"input": """/->-\\
+|   |  /----\\
+| /-+--+-\  |
+| | |  | v  |
+\-+-/  \-+--/
+  \------/   """,
+                     "expected": ['Unknown', 'Unknown'],
+                    }
+
+test += 1
+test_data[test]   = {"input": r"""/>-<\
+|   |
+| /<+-\
+| | | v
+\>+</ |
+  |   ^
+  \<->/""",
+                     "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": open(input_file, "r+").read(),
+                     "expected": ['124,130', '99, 96'],
+                    }
+
+# -------------------------------- Control program execution -------------------------------- #
+
+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'
+
+
+# -------------------------------- Actual code execution -------------------------------- #
+
+
+def grid_to_vertices (self, grid, wall = '#'):
+    self.vertices = []
+    track = {}
+    y = 0
+
+    for line in grid.splitlines():
+        line = line.replace('^', '|').replace('v', '|').replace('>', '-').replace('<', '-')
+        for x in range(len(line)):
+            if line[x] != wall:
+                self.vertices.append((x, y))
+                track[(x, y)] = line[x]
+
+        y += 1
+
+    directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
+    right, left, down, up = directions
+
+    for coords in self.vertices:
+        for direction in directions:
+            x, y = coords[0] + direction[0], coords[1] + direction[1]
+
+            if track[coords] == '-' and direction in [up, down]:
+                continue
+            if track[coords] == '|' and direction in [left, right]:
+                continue
+
+            if (x, y) in self.vertices:
+                if track[coords] in ('\\', '/'):
+                    if track[(x, y)] in ('\\', '/'):
+                        continue
+                    if track[(x, y)] == '-' and direction in [up, down]:
+                        continue
+                    elif track[(x, y)] == '|' and direction in [left, right]:
+                        continue
+                if coords in self.edges:
+                    self.edges[(coords)].append((x, y))
+                else:
+                    self.edges[(coords)] = [(x, y)]
+
+    return True
+
+pathfinding.Graph.grid_to_vertices = grid_to_vertices
+
+def turn_left (direction):
+    return (direction[1], -direction[0])
+
+def turn_right (direction):
+    return (-direction[1], direction[0])
+
+
+
+
+
+# Analyze grid
+grid = puzzle_input
+graph = pathfinding.Graph()
+graph.grid_to_vertices(puzzle_input, ' ')
+
+intersections = graph.grid_search(grid, '+')['+']
+
+directions = {'^': (0, -1), '>': (1, 0), '<': (-1, 0), 'v': (0, 1)}
+dirs = {(0, -1): '^', (1, 0): '>', (-1, 0): '<', (0, 1): 'v'}
+
+
+# Find carts
+list_carts = graph.grid_search(grid, ('^', '<', '>', 'v'))
+carts = []
+cart_positions = []
+for direction in list_carts:
+    dir = directions[direction]
+    for cart in list_carts[direction]:
+        carts.append((cart, dir, 0))
+    cart_positions.append(list_carts[direction])
+del list_carts
+carts = sorted(carts, key=lambda x: (x[0][1], x[0][0]))
+
+# Run them!
+subtick = 0
+tick = 0
+
+nb_carts = len(carts)
+collision = 0
+while True:
+    cart = carts.pop(0)
+    cart_positions.pop(0)
+    pos, dir, choice = cart
+    new_pos = (pos[0] + dir[0], pos[1] + dir[1])
+
+    print (pos, choice, dirs[dir])
+
+
+    # We need to turn
+    if new_pos not in graph.edges[pos]:
+        options = [((pos[0] + x[0], pos[1] + x[1]), x)
+                  for x in directions.values()
+                  if x != (-dir[0], -dir[1])
+                  and (pos[0] + x[0], pos[1] + x[1]) in graph.edges[pos]]
+        new_pos, dir = options[0]
+
+    # Intersection
+    if new_pos in intersections:
+        if choice % 3 == 0:
+            dir = turn_left(dir)
+        elif choice % 3 == 2:
+            dir = turn_right(dir)
+        choice += 1
+        choice %= 3
+
+    new_cart = (new_pos, dir, choice)
+
+
+
+
+
+    # Check collisions
+    if new_cart[0] in cart_positions:
+        if part_to_test == 1:
+            puzzle_actual_result = new_cart[0]
+            break
+        else:
+            print ('collision', new_cart[0])
+            collision += 1
+            carts = [c for c in carts if c[0] != new_cart[0]]
+            cart_positions = [c[0] for c in carts]
+    else:
+        carts.append(new_cart)
+        cart_positions.append(new_cart[0])
+
+
+    # Count ticks + sort carts
+    subtick += 1
+    if subtick == nb_carts - collision:
+        tick += 1
+        subtick = 0
+        collision = 0
+        nb_carts = len(carts)
+        carts = sorted(carts, key=lambda x: (x[0][1], x[0][0]))
+        cart_positions = [c[0] for c in carts]
+
+        print ('End of tick', tick, ' - Remaining', len(carts))
+        if len(carts) == 1:
+            break
+
+if part_to_test == 2:
+    puzzle_actual_result = carts
+#99, 96
+# -------------------------------- Outputs / results -------------------------------- #
+
+print ('Expected result : ' + str(puzzle_expected_result))
+print ('Actual result   : '   + str(puzzle_actual_result))
+
+
+
+
