Source: Day 4: Printing Department

Full solution for today (spoilers!).

Part 1

Given a grid of solid @ and empty cells ., count how many solid cells have less than 4 neighbors.

read more...

Source: Day 3: Lobby

Full solution for today (spoilers!).

Part 1

Given a list of numbers, for each find the two digits in the number which if concatenated make the largest. Sum these values.

For example: 811111111111119 should be 89.

read more...

Source: Day 2: Gift Shop

Full solution for today (spoilers!).

Part 1

Given a list of ranges a-b (ie 11-22), sum all values that are made of two repeated chunks of digits (ie 123123)

read more...

Source: Day 1: Secret Entrance

Full solution for today (spoilers!).

Part 1

Implement a padlock with 100 values (0-99). Run each command (L23 to turn left by 23 places) and then output the number of times you landed on zero.

read more...

It’s back! (Advent of Code)!

It’s been ten years (of advent of code, I haven’t done them all (yet)) and oh what a ten years it’s been. This time around, there will be only 12 days instead of 25, but honestly, that means I’m not working on these right up until Christmas. So I’m okay with this.

Once again, Rust! But this time, I won’t be using cargo-aoc, instead I wrote my own proc macros. Mostly to see if I could. 😄 See this section for more information.

Full solutions will once again be posted to GitHub (including previous years and possibly some I haven’t written up yet): jpverkamp/advent-of-code

read more...

Woodworm is a cute little PICO-8 puzzle game about a cute little worm… that eats wood. You can play it for free right now right here!

The goal is to turn this:

Into this:

There are a few rules to keep in mind:

• The block (and the worm) are affected by gravity

• The block can be split by into multiple pieces by eating it completely apart

  

• The worm can crawl up the side of blocks, so long as two (consecutive) segments of the worm are touching walls

  

And that’s really it.

So let’s solve it!

read more...

And so it begins.

Freshly Frosted

It’s a cute little puzzle game about making a donut factory.

It’s a lot like Solving Cosmic Express in that it’s a ‘puzzle on rails’, you are basically routing around the grid from source to target. In the way, we have to go to certain tiles in a certain order (in this case, to apply toppings to our donuts).

Let’s do it!

read more...

Source: Day 25: Code Chronicle

Full solution for today (spoilers!).

Part 1

You are given a series of locks and keys (see below). How many unique (lock, key) are there that do not overlap (they do not have to fit perfectly).

A lock starts from the top. The entire top row is # and the entire bottom row is ..

#####
.####
.####
.####
.#.#.
.#...
.....

A key is the opposite:

.....
.....
.....
#....
#.#..
#.#.#
#####

read more...

Source: Day 24: Crossed Wires

Full solution for today (spoilers!).

Part 1

Given a collection of gates of the form arg0 (AND|OR|XOR) arg2 -> out and input values of form x** and y**, what is the value of z** interpreted as a binary number?

read more...

Source: Day 23: LAN Party

Full solution for today (spoilers!).

Part 1

You are given the edges of an undirected graph. Count how many complete subgraphs of size three exist that contain one or more starting with the letter t.

Aside: Games with local (but not hotseat) multiplayer have gotten rather rarer over the years… how many people still know what a LAN party is/was?

read more...