Commit Briefs

a757f2ccec Lukas Henkel

Day 17

diff | patch | tree

4f33aa74e3 Lukas Henkel

Cache expensive node lookup

diff | patch | tree

d2acc5d041 Lukas Henkel

Simplify direction list cycling

diff | patch | tree

b80049b661 Lukas Henkel

Day 16

diff | patch | tree

4e6f21582d Lukas Henkel

Day 15

diff | patch | tree

4a940e998f Lukas Henkel

Add some utils

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

diff | patch | tree

a830181c88 Lukas Henkel

Check for the tree

This way the solution should be more generally applicable.

diff | patch | tree

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

diff | patch | tree

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.

diff | patch | tree

029cb585a5 Lukas Henkel

Day 13

diff | patch | tree

9c7d442a8c Lukas Henkel

Day 12

diff | patch | tree

9320fac455 Lukas Henkel

Day 11

diff | patch | tree

7bd93562fa Lukas Henkel

Day 10

diff | patch | tree

fbf3f987e1 Lukas Henkel

Day 9

diff | patch | tree

db13595fbf Lukas Henkel

Day 8

diff | patch | tree

1af7fd644b Lukas Henkel

Inline some math

diff | patch | tree

dfca954de5 Lukas Henkel

Much faster recursive solution

diff | patch | tree

18c13061da Lukas Henkel

Optimize

diff | patch | tree

58c83f8af7 Lukas Henkel

Day 7

diff | patch | tree

b70c7b2a5c Lukas Henkel

Optimize

diff | patch | tree

db0986abd6 Lukas Henkel

Slight optimization

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

diff | patch | tree

c7c064a8bf Lukas Henkel

Day 6

diff | patch | tree

c5b1505128 Lukas Henkel

Split parsing

diff | patch | tree

1fa917d31e Lukas Henkel

Simplify

diff | patch | tree

eba1e3d671 Lukas Henkel

Day 5

diff | patch | tree