Akumatic/Advent-of-Code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

2020 Day 17

Browse Source
This commit is contained in:
Akumatic 2020-12-17 16:16:30 +01:00
parent 8b74b51e08
commit cd1c8f7500
6 changed files with 500 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

406
2020/17/README.md Normal file
View File

@ -0,0 +1,406 @@
# 2020 Day 17: Conway Cubes
Copyright (c) Eric Wastl
#### [Direct Link](https://adventofcode.com/2020/day/17)
## Part 1
As your flight slowly drifts through the sky, the Elves at the Mythical Information Bureau at the North Pole contact you. They'd like some help debugging a malfunctioning experimental energy source aboard one of their super-secret imaging satellites.
The experimental energy source is based on cutting-edge technology: a set of Conway Cubes contained in a pocket dimension! When you hear it's having problems, you can't help but agree to take a look.
The pocket dimension contains an infinite 3-dimensional grid. At every integer 3-dimensional coordinate (`x,y,z`), there exists a single cube which is either **active** or **inactive**.
In the initial state of the pocket dimension, almost all cubes start **inactive**. The only exception to this is a small flat region of cubes (your puzzle input); the cubes in this region start in the specified **active** (`#`) or **inactive** (`.`) state.
The energy source then proceeds to boot up by executing six **cycles**.
Each cube only ever considers its **neighbors**: any of the 26 other cubes where any of their coordinates differ by at most `1`. For example, given the cube at `x=1,y=2,z=3`, its neighbors include the cube at `x=2,y=2,z=2`, the cube at `x=0,y=2,z=3`, and so on.
During a cycle, **all** cubes **simultaneously** change their state according to the following rules:
- If a cube is **active** and **exactly `2` or `3`** of its neighbors are also active, the cube remains **active**. Otherwise, the cube becomes inactive.
- If a cube is **inactive** but **exactly `3`** of its neighbors are active, the cube becomes **active**. Otherwise, the cube remains **inactive**.
The engineers responsible for this experimental energy source would like you to simulate the pocket dimension and determine what the configuration of cubes should be at the end of the six-cycle boot process.
For example, consider the following initial state:
```
.#.
..#
###
```
Even though the pocket dimension is 3-dimensional, this initial state represents a small 2-dimensional slice of it. (In particular, this initial state defines a 3x3x1 region of the 3-dimensional space.)
Simulating a few cycles from this initial state produces the following configurations, where the result of each cycle is shown layer-by-layer at each given `z` coordinate (and the frame of view follows the active cells in each cycle):
```
Before any cycles:
z=0
.#.
..#
###
After 1 cycle:
z=-1
#..
..#
.#.
z=0
#.#
.##
.#.
z=1
#..
..#
.#.
After 2 cycles:
z=-2
.....
.....
..#..
.....
.....
z=-1
..#..
.#..#
....#
.#...
.....
z=0
##...
##...
#....
....#
.###.
z=1
..#..
.#..#
....#
.#...
.....
z=2
.....
.....
..#..
.....
.....
After 3 cycles:
z=-2
.......
.......
..##...
..###..
.......
.......
.......
z=-1
..#....
...#...
#......
.....##
.#...#.
..#.#..
...#...
z=0
...#...
.......
#......
.......
.....##
.##.#..
...#...
z=1
..#....
...#...
#......
.....##
.#...#.
..#.#..
...#...
z=2
.......
.......
..##...
..###..
.......
.......
.......
```
After the full six-cycle boot process completes, **`112`** cubes are left in the **active** state.
Starting with your given initial configuration, simulate six cycles. **How many cubes are left in the active state after the sixth cycle?**
## Part 2
For some reason, your simulated results don't match what the experimental energy source engineers expected. Apparently, the pocket dimension actually has **four spatial dimensions**, not three.
The pocket dimension contains an infinite 4-dimensional grid. At every integer 4-dimensional coordinate (`x,y,z,w`), there exists a single cube (really, a **hypercube**) which is still either **active** or **inactive**.
Each cube only ever considers its **neighbors**: any of the 80 other cubes where any of their coordinates differ by at most `1`. For example, given the cube at `x=1,y=2,z=3,w=4`, its neighbors include the cube at `x=2,y=2,z=3,w=3`, the cube at `x=0,y=2,z=3,w=4`, and so on.
The initial state of the pocket dimension still consists of a small flat region of cubes. Furthermore, the same rules for cycle updating still apply: during each cycle, consider the **number of active neighbors** of each cube.
For example, consider the same initial state as in the example above. Even though the pocket dimension is 4-dimensional, this initial state represents a small 2-dimensional slice of it. (In particular, this initial state defines a 3x3x1x1 region of the 4-dimensional space.)
Simulating a few cycles from this initial state produces the following configurations, where the result of each cycle is shown layer-by-layer at each given `z` and `w` coordinate:
```
Before any cycles:
z=0, w=0
.#.
..#
###
After 1 cycle:
z=-1, w=-1
#..
..#
.#.
z=0, w=-1
#..
..#
.#.
z=1, w=-1
#..
..#
.#.
z=-1, w=0
#..
..#
.#.
z=0, w=0
#.#
.##
.#.
z=1, w=0
#..
..#
.#.
z=-1, w=1
#..
..#
.#.
z=0, w=1
#..
..#
.#.
z=1, w=1
#..
..#
.#.
After 2 cycles:
z=-2, w=-2
.....
.....
..#..
.....
.....
z=-1, w=-2
.....
.....
.....
.....
.....
z=0, w=-2
###..
##.##
#...#
.#..#
.###.
z=1, w=-2
.....
.....
.....
.....
.....
z=2, w=-2
.....
.....
..#..
.....
.....
z=-2, w=-1
.....
.....
.....
.....
.....
z=-1, w=-1
.....
.....
.....
.....
.....
z=0, w=-1
.....
.....
.....
.....
.....
z=1, w=-1
.....
.....
.....
.....
.....
z=2, w=-1
.....
.....
.....
.....
.....
z=-2, w=0
###..
##.##
#...#
.#..#
.###.
z=-1, w=0
.....
.....
.....
.....
.....
z=0, w=0
.....
.....
.....
.....
.....
z=1, w=0
.....
.....
.....
.....
.....
z=2, w=0
###..
##.##
#...#
.#..#
.###.
z=-2, w=1
.....
.....
.....
.....
.....
z=-1, w=1
.....
.....
.....
.....
.....
z=0, w=1
.....
.....
.....
.....
.....
z=1, w=1
.....
.....
.....
.....
.....
z=2, w=1
.....
.....
.....
.....
.....
z=-2, w=2
.....
.....
..#..
.....
.....
z=-1, w=2
.....
.....
.....
.....
.....
z=0, w=2
###..
##.##
#...#
.#..#
.###.
z=1, w=2
.....
.....
.....
.....
.....
z=2, w=2
.....
.....
..#..
.....
.....
```
After the full six-cycle boot process completes, **`848`** cubes are left in the **active** state.
Starting with your given initial configuration, simulate six cycles in a 4-dimensional space. **How many cubes are left in the active state after the sixth cycle?**

68
2020/17/code.py Normal file
View File

@ -0,0 +1,68 @@
# SPDX-License-Identifier: MIT
# Copyright (c) 2020 Akumatic
#
# https://adventofcode.com/2020/day/17
from itertools import product
def read_file() -> list:
with open(f"{__file__.rstrip('code.py')}input.txt", "r") as f:
return [list(line.strip()) for line in f.readlines()]
def parse_input(input: list) -> set:
active_cubes = set()
for y in range(len(input)):
for x in range(len(input[0])):
if input[y][x] == "#":
active_cubes.add((x, y, 0, 0))
return active_cubes
def simulate(active_cubes: set, size: int = 3, iterations: int = 6) -> int:
assert 3 <= size <= 4
# neighbor positions
positions = product(range(-1, 2), repeat=size)
if size == 4:
npos = tuple(pos for pos in positions if pos != (0, 0, 0, 0))
else: # size == 4
npos = tuple((pos[0], pos[1], pos[2], 0) for pos in positions if pos != (0, 0, 0))
# iterations
for _ in range(iterations):
next_active = set()
neighbors = set()
# check if active cubes stay active
for cube in active_cubes:
count = 0
for n in npos:
pos = tuple(cube[i] + n[i] for i in range(4))
if pos in active_cubes:
count += 1
else:
neighbors.add(pos)
if 2 <= count <= 3:
next_active.add(cube)
# check neighbors of active cubes if they become active
for cube in neighbors:
count = 0
for n in npos:
pos = tuple(cube[i] + n[i] for i in range(4))
if pos in active_cubes:
count += 1
if count == 3:
next_active.add(cube)
active_cubes = next_active
return len(active_cubes)
def part1(active_cubes: set) -> int:
return simulate(active_cubes, 3)
def part2(active_cubes: set) -> int:
return simulate(active_cubes, 4)
if __name__ == "__main__":
input = read_file()
data = parse_input(input)
print(f"Part 1: {part1(data)}")
print(f"Part 2: {part2(data)}")

8
2020/17/input.txt Normal file
View File

@ -0,0 +1,8 @@
.#######
#######.
###.###.
#....###
.#..##..
#.#.###.
###..###
.#.#.##.

2
2020/17/solution.txt Normal file
View File

@ -0,0 +1,2 @@
Part 1: 395
Part 2: 2296

15
2020/17/test_code.py Normal file
View File

@ -0,0 +1,15 @@
# SPDX-License-Identifier: MIT
# Copyright (c) 2020 Akumatic
from code import part1, part2, parse_input
def test():
input = [[".", "#", "."], [".", ".", "#"], ["#", "#", "#"]]
data = parse_input(input)
assert part1(data) == 112
print(f"Passed part 1")
assert part2(data) == 848
print(f"Passed part 2")
if __name__ == "__main__":
test()

2
2020/README.md
View File

@ -23,7 +23,7 @@ Collect stars by solving puzzles. Two puzzles will be made available on each day
| 11 | :white_check_mark: | :white_check_mark: || 12 | :white_check_mark: | :white_check_mark: |
| 13 | :white_check_mark: | :white_check_mark: || 14 | :white_check_mark: | :white_check_mark: |
| 15 | :white_check_mark: | :white_check_mark: || 16 | :white_check_mark: | :white_check_mark: |
| 17 | | || 18 | | |
| 17 | :white_check_mark: | :white_check_mark: || 18 | | |
| 19 | | || 20 | | |
| 21 | | || 22 | | |
| 23 | | || 24 | | |