Day19 Part1
This commit is contained in:
parent
34155ab4f3
commit
68f008c7ff
@ -26,12 +26,14 @@ func main() {
|
|||||||
highestGeode := make([]int, len(lines))
|
highestGeode := make([]int, len(lines))
|
||||||
for i, line := range lines {
|
for i, line := range lines {
|
||||||
blueprint := getBluePrint(line)
|
blueprint := getBluePrint(line)
|
||||||
//fastestTime := getFastestTimeToElementN(blueprint, map[[4]int]State{[4]int{0, 0, 0, 0, 1, 0, 0, 0}: State{[4]int{0, 0, 0, 0}, [4]int{1, 0, 0, 0}, 0}}, 3)
|
highestGeodeLine := 0
|
||||||
//startStates := getAllPossibleCombinationsWithFastestTime(blueprint, map[[4]int]State{[4]int{0, 0, 0, 0, 1, 0, 0, 0}: State{[4]int{0, 0, 0, 0}, [4]int{1, 0, 0, 0}, 0}}, 3, fastestTime)
|
for j := 0; j < 50; j++ {
|
||||||
//tmpStates := getAllPossibleCombinationsWithFastestTime(blueprint, map[[4]int]State{[4]int{0, 0, 0, 0, 1, 0, 0, 0, 0}: State{[4]int{0, 0, 0, 0}, [4]int{1, 0, 0, 0}, 0}}, 2, fastestTime)
|
tmphighestGeode := getHighestGeode(blueprint, map[[4]int]State{[4]int{0, 0, 0, 0}: State{[4]int{0, 0, 0, 0}, [4]int{1, 0, 0, 0}, 0}})
|
||||||
//fastestTime = getFastestTimeToElementN(blueprint, tmpStates, 3)
|
if tmphighestGeode > highestGeodeLine {
|
||||||
//startStates = getAllPossibleCombinationsWithFastestTime(blueprint, startStates, 3, fastestTime)
|
highestGeodeLine = tmphighestGeode
|
||||||
highestGeode[i] = getHighestGeode(blueprint, map[[4]int]State{[4]int{0, 0, 0, 0}: State{[4]int{0, 0, 0, 0}, [4]int{1, 0, 0, 0}, 0}})
|
}
|
||||||
|
}
|
||||||
|
highestGeode[i] = highestGeodeLine
|
||||||
fmt.Println(highestGeode[i])
|
fmt.Println(highestGeode[i])
|
||||||
}
|
}
|
||||||
sum := 0
|
sum := 0
|
||||||
|
Loading…
Reference in New Issue
Block a user