I am currently doing the advent of code 2021 programming challenge, which (at the time I’m writing this), is on day 7.
I got the motivation to write this post from this tweet that had some questions about the solution.
I am going to attempt to explain my approach to this problem and why we find this particular solution, so if you have not seen the problem I encourage it to try it yourself before reading this (have fun!).
You are in a submarine, deep under the ocean, when a giant whale decides to eat you. suddenly a bunch of crabs in tiny crabsubmarines appear and decide to help you. To be able to help you the crabs need to align themselves, however, being crabs after all, they can only move sideways. The crab submarines have a limited amount of fuel, so you need to find the where the crabs should align in order to expend the smallest amount of fuel as possible. The puzzle input is the horizontal position of the crab.
In the given example there are n crabs at positions 16,1,2,0,4,2,7,1,2,14
. We can represent this with a simple diagram, making a grid with 16 columns for all the possible horizontal crab position, a row per crab and marking the position of the crab with C
:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

. . . . . . . . . . . . . . . . C
. C . . . . . . . . . . . . . . .
. . C . . . . . . . . . . . . . .
C . . . . . . . . . . . . . . . .
. . . . C . . . . . . . . . . . .
. . C . . . . . . . . . . . . . .
. . . . . . . C . . . . . . . . .
. C . . . . . . . . . . . . . . .
. . C . . . . . . . . . . . . . .
. . . . . . . . . . . . . . C . .
Let’s say we want them to align at column 3, then our final crab positions will be:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
. . . C . . . . . . . . . . . . .
Our goal is to find the column in which to align them, for which the least amount of fuel will be consumed by the crabs. If we choose column \(3\), then the first crab will have to spend \(16  3 = 13\) units of fuel, the second crab will need \(3  1 = 2\) units of fuel and so on.
This is very simple to solve with a brute force approach, we define a function to compute the cost of moving all the crabs to a column, apply this function to all possible columns and see which one is smallest:


This will give us the (correct) answer of \(2\) with a fuel cost of \(37\). Now this is a fine solution for the test input but it will be very inefficient if we have more crabs and if they are more spread out.
The first thing I thought about is exploring significant points like the mean or the median of our crab positions. In our example above the mean is not the optimal solution however the median is equal to \(2\), which is optimal. After a bit more saerching I found the geometric median, which is ” the point minimizing the sum of distances to the sample points” of a dataset. This is exactly what we are looking for, and per the wikipedia article, in a 1dimensional setting (like ours) it is equal to the median. Bingo we have a very simple way of getting the optimal position: just take the median of our dataset, it is super quick and we only need to compute 1 thing. Our new code becomes:


Through a bit of exploration I think anybody would have realized that the median is actually the optimum, however we can also derive it analytically and prove why the optimum is actually the median.
Our problem is in essence an optimization problem, we have a cost (the fuel usage) which depends on a parameter (the column in which to line up) and we want to minimize that cost w.r.t the chosen parameter. This is a very common framework and if the cost is a simple function we can derive an analytical solution to our problem.
First let’s define some terms:
The first step in any optimization function is to define the cost function. In our case it’s quite simple, our cost is the sum of all the absolute differences between each crab and the chosen value of \(\theta\): $$ C(\theta) = \sum_{i=1}^nx_i  \theta $$
Now that we have this cost function how are we supposed to find the minimum you might ask ? If you have taken a calculus class this will no doubt sound familiar, we need to compute the derivative of \(C(\theta)\) and find the value of \(\theta\) for which it is equal to 0. That simple!
Now this cost function is simply a sum so it will be quite easy to compute its derivative. First we need to break it up, we can define the absolute value \(x_i  \theta\) as follows:
So our cost function becomes:
If we take the derivative of this expression w.r.t \(\theta\) both sums which only contain \(x_i\) will be reduced to 0, and since the derivative of the sum is equal to the sum of the derivatives it is eay to compute the rest of the terms:
There we have a simple definition of the derivative of our cost function w.r.t to the parameter we wish to optimize. Now to find \(\theta^*\) we simply need to find where the derivative is equal to 0:
You will notice that for our derivative to be equal to 0 we need to have as many points \(\leq\theta^* \) as there are points \(>\theta^* \), which is exaclty the definition of the median.
Take a minute to work through it by yourself and make sure I haven’t made any mistakes but by now it should make sense *why* the median is the optimal solution in our problem.
As is usual in advent of code problems, getting the correct answer in the first problem unlocks a second, harder, problem which builds upon the first. In our case the setting is the same except that we misunderstood the fuel usage of the crab submarines. Instead of using up 1 unit of fuel per unit of distance, they use up an additional unit of fuel for each unit of distance covered. For instance, a crab submarine that will travel 3 units of distance will use up \(1 + 2 + 3 = 6\) units of fuel.
The brute force approach still works fine on the smaller test data, we simply need to update our compute_fuel_usage
function:


But once more this approach is super inneficient as we grow the number of crabs and the number of columns. So here it is better to consider this as an optimization problem once more. We simply need to redefine the cost function to fit our problem and we can follow the exact same steps as before to find \(\theta^*\). And a way to write this cost is as follows:
$$ C(\theta) = \sum_{i=1}^n\bigg( \sum_{j=1}^{x_i  \theta} j \bigg) $$
Where both sums corresponds to both loops of our compute_new_fuel_usage
function. Now this cost function does not see, very derivative friendly so lets try to break it up. The first thing we need to know is that there is a forumla for the sum of the \(k\) first natural integers:
$$ \sum_{i=1}^{k} i = \frac{k \cdot (k + 1)}{2} $$
So in our case we can rewrite the cost function as:
whoo that’s big and scary, but when we take the derivative w.r.t to \(\theta\) all the sums that don’t depend on \(\theta\) will disappear:
Let’s call the last term \(R\) for notational simplicity and we have our derivative:
$$ \frac{\partial C(\theta)}{\partial\theta} =  \sum_{i=1}^n x_i + \sum_{i=1}^n\theta + R $$
Now we just need to find the minimum:
Now we can assume that R divided by n is probably small if the dataset is well distributed ^{1}. So our optimal value will be close to the mean of our crab positions:
$$ \theta^* \approx \frac{1}{n}\sum_{i=1}^n x_i $$
And it is indeed a good place to start, so we can rewrite our code to look at the points around the mean to find the optimum:


This will allow us to find the optimal point much more efficiently!
I hope you understood the approach I took and if you are interested in my progress on advent of code 2021 you can check out my github repo for my python solutions (while I can solve the problems :p).
Thanks for reading and if you notice any mistakes in my reasonning please don’t hesitate to point them out to me!
N.B: as pointed out here the value of \(R\) is actually bounded:
Since all \(x_i\) and \(\theta\) values are positive: \( 0 \leq card({x_i\leq\theta}) \leq n \) and \( 0 \leq card({x_i>\theta}) \leq n \). Therefore: