AoC 2021 Day 25: Cucumbinator

2021-12-25

Source: Sea Cucumber

Part 1: Load a grid of empty cells (`.`), east movers (`>`), and south movers (`v`). Each step, move all east movers than all south movers (only if they can this iteration). Wrap east/west and north/south. How many steps does it take the movers to get stuck?

AoC 2021 Day 24: Aluinator

2021-12-24

Source: Arithmetic Logic Unit

Part 1: Simulate an ALU with 4 registers (`w`, `x`, `y`, and `z`) and instructions defined below. Find the largest 14 digit number with no 0 digits which result in `z=0`.

AoC 2021 Day 22: Cubinator

2021-12-22

Source: Reactor Reboot

Part 1: Given a series of 3D cubes that either turn ON all or turn OFF all points in their region, calculate how many points in the region (-50..50,-50..50,-50..50) are ON at the end.

AoC 2021 Day 20: Enhancinator

2021-12-20

Source: Trench Map

Part 1: Given a 9->1 cellular automota update function (take the pixel and 8 surrounding pixels as a 9-bit index into the function) and a binary image, apply the function twice and count the number of ’lit’ pixels. Assume that the canvas is infinite.

AoC 2021 Day 19: Point Matchinator

2021-12-19

Source: Snailfish

Part 1: You will be given a series of Scanners, each of which will tell you the location (from their point of view) of a series of Beacons. Each Scanner may be flipped or rotated in increments of 90 degrees in any direction. Determine where each Scanner and Beacon is by overlaying the maps (with at least pairwise 12 matches).

AoC 2021 Day 18: Pairs of Pairs

2021-12-18

Source: Snailfish

Part 1: Given the following definition of Snailfish numbers, add a series of Snailfish numbers and return the magnitude of the result.

AoC 2021 Day 16: Depacketinator

2021-12-16

Source: Packet Decoder

Part 1: Given a recursive binary packet definition (see below), parse the given packet. Return the sum of each packet’s `version`.

AoC 2021 Day 12: Submarine Spider

2021-12-12

Source: Passage Pathing

Part 1: Given a list of edges in a bi-directional graph, count the number of paths from `start` to `end` such that nodes named with lowercase letters are visited once, and nodes with uppercase letters can be visited any number of times.

AoC 2021 Day 11: Octopus Flashinator

2021-12-11

Source: Dumbo Octopus

Part 1: Simulate a grid of numbers such that on each tick: advance all numbers by 1, any number that increases over 9 will ‘flash’ and add 1 to all neighbors (recursively, but each cell can only flash once) and then reset to 0. Count the number of flashes in the first 100 ticks.

AoC 2021 Day 10: Chunkinator

2021-12-10

Source: Syntax Scoring

Part 1: Given a sequence of () [] {}, and <> with nesting allowed. Find the first syntax error (where the wrong closing symbol is used). Scoring 3, 57, 1197, and 25137 respectively for each error, calculate the total error score.

Source: Sea Cucumber

Part 1: Load a grid of empty cells (.), east movers (>), and south movers (v). Each step, move all east movers than all south movers (only if they can this iteration). Wrap east/west and north/south. How many steps does it take the movers to get stuck?

Source: Arithmetic Logic Unit

Part 1: Simulate an ALU with 4 registers (w, x, y, and z) and instructions defined below. Find the largest 14 digit number with no 0 digits which result in z=0.

Source: Reactor Reboot

Part 1: Given a series of 3D cubes that either turn ON all or turn OFF all points in their region, calculate how many points in the region (-50..50,-50..50,-50..50) are ON at the end.

Source: Trench Map

Part 1: Given a 9->1 cellular automota update function (take the pixel and 8 surrounding pixels as a 9-bit index into the function) and a binary image, apply the function twice and count the number of ’lit’ pixels. Assume that the canvas is infinite.

Source: Snailfish

Source: Snailfish

Part 1: Given the following definition of Snailfish numbers, add a series of Snailfish numbers and return the magnitude of the result.

Source: Packet Decoder

Part 1: Given a recursive binary packet definition (see below), parse the given packet. Return the sum of each packet’s version.

Source: Passage Pathing

Part 1: Given a list of edges in a bi-directional graph, count the number of paths from start to end such that nodes named with lowercase letters are visited once, and nodes with uppercase letters can be visited any number of times.

Source: Dumbo Octopus

Part 1: Simulate a grid of numbers such that on each tick: advance all numbers by 1, any number that increases over 9 will ‘flash’ and add 1 to all neighbors (recursively, but each cell can only flash once) and then reset to 0. Count the number of flashes in the first 100 ticks.

Source: Syntax Scoring

Part 1: Given a sequence of () [] {}, and <> with nesting allowed. Find the first syntax error (where the wrong closing symbol is used). Scoring 3, 57, 1197, and 25137 respectively for each error, calculate the total error score.

Part 1: Load a grid of empty cells (`.`), east movers (`>`), and south movers (`v`). Each step, move all east movers than all south movers (only if they can this iteration). Wrap east/west and north/south. How many steps does it take the movers to get stuck?

Part 1: Simulate an ALU with 4 registers (`w`, `x`, `y`, and `z`) and instructions defined below. Find the largest 14 digit number with no 0 digits which result in `z=0`.

Part 1: Given a recursive binary packet definition (see below), parse the given packet. Return the sum of each packet’s `version`.

Part 1: Given a list of edges in a bi-directional graph, count the number of paths from `start` to `end` such that nodes named with lowercase letters are visited once, and nodes with uppercase letters can be visited any number of times.