Mercurial > repos > other > adventofcode2023
view day11.txt @ 33:676461cc3a70
Day 23 - track segments, not each space
This allows us to explore the branches once then do quicker calculations
for valid route lengths. But still requires exploring 1,262,816 routes
to find the longest!
| author | IBBoard <dev@ibboard.co.uk> |
|---|---|
| date | Thu, 04 Jan 2024 14:52:24 +0000 |
| parents | 1e16a25a9553 |
| children |
line wrap: on
line source
--- Day 11: Cosmic Expansion --- There is a map (your puzzle input). The image includes empty space (.) and galaxies (#). For example: ...#...... .......#.. #......... .......... ......#... .#........ .........# .......... .......#.. #...#..... We need to calculate the distance between each galaxy. But the space between them is non-linear. Any rows or columns that contain no galaxies should all actually be twice as big. In the above example, three columns and two rows contain no galaxies: v v v ...#...... .......#.. #......... >..........< ......#... .#........ .........# >..........< .......#.. #...#..... ^ ^ ^ These rows and columns need to be twice as big; the result of cosmic expansion therefore looks like this: ....#........ .........#... #............ ............. ............. ........#.... .#........... ............# ............. ............. .........#... #....#....... Equipped with this expanded universe, the shortest path between every pair of galaxies can be found. It can help to assign every galaxy a unique number: ....1........ .........2... 3............ ............. ............. ........4.... .5........... ............6 ............. ............. .........7... 8....9....... In these 9 galaxies, there are 36 pairs. Only count each pair once; order within the pair doesn't matter. For each pair, find any shortest path between the two galaxies using only steps that move up, down, left, or right exactly one . or # at a time. (The shortest path between two galaxies is allowed to pass through another galaxy.) For example, here is one of the shortest paths between galaxies 5 and 9: ....1........ .........2... 3............ ............. ............. ........4.... .5........... .##.........6 ..##......... ...##........ ....##...7... 8....9....... This path has length 9 because it takes a minimum of nine steps to get from galaxy 5 to galaxy 9 (the eight locations marked # plus the step onto galaxy 9 itself). Here are some other example shortest path lengths: Between galaxy 1 and galaxy 7: 15 Between galaxy 3 and galaxy 6: 17 Between galaxy 8 and galaxy 9: 5 In this example, after expanding the universe, the sum of the shortest path between all 36 pairs of galaxies is 374. Expand the universe, then find the length of the shortest path between every pair of galaxies. What is the sum of these lengths? --- Part Two --- Now, instead of the expansion you did before, make each empty row or column one million times larger. That is, each empty row should be replaced with 1000000 empty rows, and each empty column should be replaced with 1000000 empty columns. (In the example above, if each empty row or column were merely 10 times larger, the sum of the shortest paths between every pair of galaxies would be 1030. If each empty row or column were merely 100 times larger, the sum of the shortest paths between every pair of galaxies would be 8410. However, your universe will need to expand far beyond these values.) Starting with the same initial image, expand the universe according to these new rules, then find the length of the shortest path between every pair of galaxies. What is the sum of these lengths?