AoC 2017 Day 7: Tree

2017-12-07

Source: Recursive Circus

Part 1: A tree is defined as such:

node (weight) -> child1, child2, ...
node (weight)

Where a node always has a weight, but may or may not have child nodes.

What is the name of the root node of the tree (the node without a parent)?

AoC 2017 Day 6: Tightrope

2017-12-06

Source: Memory Reallocation

Part 1: Start with n stacks of different sizes. Take the largest block and distribute its items starting with n+1 and looping around. How many iterations of this does it take before you see a state you’ve seen before?

AoC 2017 Day 5: 21 Jump Street

2017-12-05

Source: A Maze of Twisty Trampolines, All Alike¹

Part 1: Interpret a program made entirely of jump instructions: each instruction is how many steps to jump. Any time you use an instruction to jump, increase the value of that jump by 1 for next time. How many total steps does it take to escape (jump out of bounds)?

AoC 2017 Day 4: Password Validator

2017-12-04

Source: High-Entropy Passphrases

Part 1: Given a list of passphrases, count how many contain no duplicate words.

AoC 2017 Day 3: Spiraly

2017-12-03

Source: Spiral Memory

Part 1: Create a grid in a spiral pattern like so:

17 16 15 14 13 18 5 4 3 12 19 6 1 2 11 20 7 8 9 10 21 22 23—> …

AoC 2017 Day 2: Check It

2017-12-02

Source: Corruption Checksum

Part 1: The checksum of a list of numbers is the difference between the largest and smallest number in the row. What is the sum of checksums of a file containing many such lists?

AoC 2017 Day 1: Ahctpat

2017-12-01

Source: Inverse Captcha

Part 1: Given a number, what is the sum of pairs of digits that match (wrapping the last digit around to the first)?

AoC 2017: Library Functions

2017-12-01

As mentioned in the main post, I’m structuring my solutions a bit differently this year. Rather than repeating the same relatively lengthy header in each function, we’re going to have a few shared files that can be imported or used for every problem.

AoC 2016 Day 25: Assembunny3

2016-12-25

Source: Clock Signal

Part 1: Take the assembunny interpreter from day 12 and add one new instruction (out x) which transmits the value x (either an integer or register). Find the lowest value we can initialize a to so that the output signals form an infinite repeating pattern of 0, 1, 0, 1, …