Make day 16 part 1 much faster

Author: terminalnode

solutions/day16/main.go

@@ -43,11 +43,24 @@ func loop(
 		return
 	}
 
-	loop(r.turnClockwise(), i, set)
-	loop(r.turnCounterClockwise(), i, set)
-	fwd, err := r.forward(i.m)
+	newR, err := r.forward(i.m)
 	if err == nil {
-		loop(fwd, i, set)
+		loop(newR, i, set)
+	}
+
+	newR, err = r.turnClockwise().forward(i.m)
+	if err == nil {
+		loop(newR, i, set)
+	}
+
+	newR, err = r.turnClockwise().turnClockwise().forward(i.m)
+	if err == nil {
+		loop(newR, i, set)
+	}
+
+	newR, err = r.turnCounterClockwise().forward(i.m)
+	if err == nil {
+		loop(newR, i, set)
 	}
 
 	return
@@ -57,27 +70,17 @@ func lowestSoFar(
 	i parsedInput,
 	set visitedSet,
 ) int {
-	lowest := 0
-	for _, n := range set[i.e.Y][i.e.X] {
-		if lowest == 0 || n < lowest {
-			lowest = n
-		}
-	}
-	return lowest
+	return set[i.e.Y][i.e.X]
 }
 
 func initializeVisitedSet(
 	i parsedInput,
 ) visitedSet {
 	set := make(visitedSet)
 	for y, line := range i.m {
-		set[y] = make(map[intX]map[intDirection]intScore)
+		set[y] = make(map[intX]intScore)
 		for x, _ := range line {
-			set[y][x] = make(map[intDirection]intScore)
-			set[y][x][North] = math.MaxInt
-			set[y][x][South] = math.MaxInt
-			set[y][x][West] = math.MaxInt
-			set[y][x][East] = math.MaxInt
+			set[y][x] = math.MaxInt
 		}
 	}
 	return set

solutions/day16/reindeer.go

@@ -9,7 +9,7 @@ type intX = int
 type intY = int
 type intDirection = int
 type intScore = int
-type visitedSet = map[intY]map[intX]map[intDirection]intScore
+type visitedSet = map[intY]map[intX]intScore
 
 const (
 	North = iota
@@ -79,9 +79,9 @@ func (r reindeer) turnCounterClockwise() reindeer {
 func (r reindeer) visitAndCheckIfDead(
 	set visitedSet,
 ) bool {
-	v := set[r.p.Y][r.p.X][r.direction]
+	v := set[r.p.Y][r.p.X]
 	if v == 0 || r.score < v {
-		set[r.p.Y][r.p.X][r.direction] = r.score
+		set[r.p.Y][r.p.X] = r.score
 		return false
 	}
 	return true