Commit Briefs

c6567752c5 Lukas Henkel

Day 25 (master)


97d18b9483 Lukas Henkel

Day 24

Well, this works for my input


457f75706b Lukas Henkel

Day 23


95ee6b354e Lukas Henkel

Day 22


f771a96527 Lukas Henkel

Day 21


3311bc2c2a Lukas Henkel

Optimizations


bc03c52ea7 Lukas Henkel

Remove the hashtable, not needed


7660603219 Lukas Henkel

Simplify into single function


ce65cacb7e Lukas Henkel

Simplify pathfinding

BFS is not actually needed


40d0e7fa0b Lukas Henkel

Day 20


178cf0b10b Lukas Henkel

Day 19


e0211656e1 Lukas Henkel

Update SBCL


5cd36c4415 Lukas Henkel

Reverse task 2

This way is much faster


ddf4527960 Lukas Henkel

Day 18


0372dbdec3 Lukas Henkel

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.


a757f2ccec Lukas Henkel

Day 17


4f33aa74e3 Lukas Henkel

Cache expensive node lookup


d2acc5d041 Lukas Henkel

Simplify direction list cycling


b80049b661 Lukas Henkel

Day 16


4e6f21582d Lukas Henkel

Day 15


4a940e998f Lukas Henkel

Add some utils

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


a830181c88 Lukas Henkel

Check for the tree

This way the solution should be more generally applicable.


d7b2a01d55 Lukas Henkel

Optimize and cleanup day 14

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


aea08906c9 Lukas Henkel

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.


029cb585a5 Lukas Henkel

Day 13