Commits

Commit:
b1f35d24aa80dbaba4cde18d70685c9ddf787cdc
From:
Lukas Henkel <lh@entf.net>
Date:
t
diff | patch | tree
Commit:
817981924d516c13afcc203c3e0b7b3cbfce7a41
From:
Lukas Henkel <lh@entf.net>
Date:
t
diff | patch | tree
Commit:
e0211656e194315d0d60c48326eed9977b6860e6
From:
Lukas Henkel <lh@entf.net>
Date:
Update SBCL
diff | patch | tree
Commit:
5cd36c441567ae4b5c7bd4bc399e39eea75e1206
From:
Lukas Henkel <lh@entf.net>
Date:
Reverse task 2 This way is much faster
diff | patch | tree
Commit:
ddf4527960184f991ca2d6abda4882b6c351312e
From:
Lukas Henkel <lh@entf.net>
Date:
Day 18
diff | patch | tree
Commit:
0372dbdec3d209ba51f73f4a8572505fed15b415
From:
Lukas Henkel <lh@entf.net>
Date:
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.
diff | patch | tree
Commit:
a757f2ccecb5b65c1c76e6099f2ae82a0d934f08
From:
Lukas Henkel <lh@entf.net>
Date:
Day 17
diff | patch | tree
Commit:
4f33aa74e3fc0f489f1d20fe970de7370eb84f9f
From:
Lukas Henkel <lh@entf.net>
Date:
Cache expensive node lookup
diff | patch | tree
Commit:
d2acc5d04156c20564f7a69ecb395d930c192279
From:
Lukas Henkel <lh@entf.net>
Date:
Simplify direction list cycling
diff | patch | tree
Commit:
b80049b66156a9cbb8f881dc7a18b7c4a1642138
From:
Lukas Henkel <lh@entf.net>
Date:
Day 16
diff | patch | tree
Commit:
4e6f21582d9227d70475791ac29421d5bf3e4f44
From:
Lukas Henkel <lh@entf.net>
Date:
Day 15
diff | patch | tree
Commit:
4a940e998f54d87e8893913334872f90b7a3e73c
From:
Lukas Henkel <lh@entf.net>
Date:
Add some utils While experimenting I added some stuff that might be useful for future days
diff | patch | tree
Commit:
a830181c88f262b1facfdc16d53bd1d883a94440
From:
Lukas Henkel <lh@entf.net>
Date:
Check for the tree This way the solution should be more generally applicable.
diff | patch | tree
Commit:
d7b2a01d551e821e13e7d0e2dfd2e37f6c8adf63
From:
Lukas Henkel <lh@entf.net>
Date:
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
Commit:
aea08906c977042acf39efeca6007b925df85f0c
From:
Lukas Henkel <lh@entf.net>
Date:
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
Commit:
029cb585a5242f8ac2cf2bd5309519b7dc5f43d8
From:
Lukas Henkel <lh@entf.net>
Date:
Day 13
diff | patch | tree
Commit:
9c7d442a8c160ee59e815001d865082616b8bfdc
From:
Lukas Henkel <lh@entf.net>
Date:
Day 12
diff | patch | tree
Commit:
9320fac455489ef7263b15f3a6336c7ed34a7934
From:
Lukas Henkel <lh@entf.net>
Date:
Day 11
diff | patch | tree
Commit:
7bd93562fa1827db036c3b25cfe787b809b12669
From:
Lukas Henkel <lh@entf.net>
Date:
Day 10
diff | patch | tree
Commit:
fbf3f987e153a05c6fed487dfd94c2ce5677b575
From:
Lukas Henkel <lh@entf.net>
Date:
Day 9
diff | patch | tree
Commit:
db13595fbfe221cdbdfbe5dd8134ed28f25c8f71
From:
Lukas Henkel <lh@entf.net>
Date:
Day 8
diff | patch | tree
Commit:
1af7fd644bbac6ad0c08078a59d37b095fbeca10
From:
Lukas Henkel <lh@entf.net>
Date:
Inline some math
diff | patch | tree
Commit:
dfca954de59ae6453cfc4e6aa21316dbe790a432
From:
Lukas Henkel <lh@entf.net>
Date:
Much faster recursive solution
diff | patch | tree
Commit:
18c13061da0c7b642446e64b7dc1a561c3958fc0
From:
Lukas Henkel <lh@entf.net>
Date:
Optimize
diff | patch | tree
Commit:
58c83f8af7c4abc47f02dc051fd17da85272eb0d
From:
Lukas Henkel <lh@entf.net>
Date:
Day 7
diff | patch | tree