Commits


Day 17


Cache expensive node lookup


Simplify direction list cycling


Day 16


Day 15


Add some utils While experimenting I added some stuff that might be useful for future days


Check for the tree This way the solution should be more generally applicable.


Optimize and cleanup day 14 - Don't move robots, instead calculate new robot position - Calculate safety factor inline - Early return for overlap detection


Day 14 This works by detecting states where no robots overlap. This seems to work fine for my input, but it is a bit hacky.


Day 13


Day 12


Day 11


Day 10


Day 9


Day 8


Inline some math


Much faster recursive solution


Optimize


Day 7


Optimize


Slight optimization Check only the spots in task 2 where the guard visited in task 1


Day 6


Split parsing


Simplify


Day 5