Commit Briefs
Day 25 (master)
Day 24
Well, this works for my input
Simplify pathfinding
BFS is not actually needed
Reverse task 2
This way is much faster
Add optional compiler
Just for fun. While the resulting code is much faster than the interpreter, the compile process eats up any speedups and it ends up being slower overall.
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.