8 months ago b1f35d24aa Lukas Henkel
t (test)
8 months ago 817981924d Lukas Henkel
t
8 months ago 5cd36c4415 Lukas Henkel
Reverse task 2 ⋅⋅⋅
This way is much faster
8 months ago ddf4527960 Lukas Henkel
Day 18
8 months ago 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.
8 months ago a757f2ccec Lukas Henkel
Day 17
8 months ago b80049b661 Lukas Henkel
Day 16
8 months ago 4e6f21582d Lukas Henkel
Day 15
8 months ago 4a940e998f Lukas Henkel
Add some utils ⋅⋅⋅
While experimenting I added some stuff that might be useful for future days
8 months ago a830181c88 Lukas Henkel
Check for the tree ⋅⋅⋅
This way the solution should be more generally applicable.
8 months ago 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
8 months ago 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.
8 months ago 029cb585a5 Lukas Henkel
Day 13
8 months ago 9c7d442a8c Lukas Henkel
Day 12
8 months ago 9320fac455 Lukas Henkel
Day 11
8 months ago 7bd93562fa Lukas Henkel
Day 10
8 months ago fbf3f987e1 Lukas Henkel
Day 9
8 months ago db13595fbf Lukas Henkel
Day 8
8 months ago 18c13061da Lukas Henkel
Optimize
8 months ago 58c83f8af7 Lukas Henkel
Day 7