Day 9

9.py

@@ -0,0 +1,35 @@
+#!/usr/bin/python
+
+import re
+
+with open('9.txt', 'r') as file:
+    input = file.read()
+
+FUNC = max  # min for part 1
+
+distances = {}
+places = {}
+
+for line in input.splitlines():
+    (source, dest, distance) = re.match('^(.*?) to (.*?) = ([0-9]+)$', line).group(1, 2, 3)
+    distances[(source, dest)] = int(distance)
+    distances[(dest, source)] = int(distance)
+    places[dest] = True
+    places[source] = True
+
+places = places.keys()
+
+
+def without(list, item):
+    return [x for x in list if x != item]
+
+
+def find_shortest(current, to_visit):
+    if len(to_visit) == 0:
+        return 0
+
+    return FUNC([distances[(current, target)] +
+                find_shortest(target, without(to_visit, target))
+                for target in to_visit])
+
+print(FUNC([find_shortest(place, without(places, place)) for place in places]))

9.txt

@@ -0,0 +1,28 @@
+Faerun to Norrath = 129
+Faerun to Tristram = 58
+Faerun to AlphaCentauri = 13
+Faerun to Arbre = 24
+Faerun to Snowdin = 60
+Faerun to Tambi = 71
+Faerun to Straylight = 67
+Norrath to Tristram = 142
+Norrath to AlphaCentauri = 15
+Norrath to Arbre = 135
+Norrath to Snowdin = 75
+Norrath to Tambi = 82
+Norrath to Straylight = 54
+Tristram to AlphaCentauri = 118
+Tristram to Arbre = 122
+Tristram to Snowdin = 103
+Tristram to Tambi = 49
+Tristram to Straylight = 97
+AlphaCentauri to Arbre = 116
+AlphaCentauri to Snowdin = 12
+AlphaCentauri to Tambi = 18
+AlphaCentauri to Straylight = 91
+Arbre to Snowdin = 129
+Arbre to Tambi = 53
+Arbre to Straylight = 40
+Snowdin to Tambi = 15
+Snowdin to Straylight = 99
+Tambi to Straylight = 70