git.entf.net

Commits

Commit:: c6567752c59474c54d63edcfc1a3105d57f5a8b2
From:: Lukas Henkel <lh@entf.net>
Date:: Wed Dec 25 05:27:35 2024 UTC

Day 25

diff | patch | tree

Commit:: 97d18b948329b91bd9148c09f1b4b6b0bcbe8f6a
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 24 16:16:46 2024 UTC

Day 24 Well, this works for my input

diff | patch | tree

Commit:: 457f75706b34cdea7df3379f1bd773fc398e17fd
From:: Lukas Henkel <lh@entf.net>
Date:: Mon Dec 23 06:49:23 2024 UTC

Day 23

diff | patch | tree

Commit:: 95ee6b354e650c61002363dafd4421f2df02aa23
From:: Lukas Henkel <lh@entf.net>
Date:: Sun Dec 22 05:38:29 2024 UTC

Day 22

diff | patch | tree

Commit:: f771a9652753fd89882480d30984e2378b32e7c8
From:: Lukas Henkel <lh@entf.net>
Date:: Sat Dec 21 09:54:45 2024 UTC

Day 21

diff | patch | tree

Commit:: 3311bc2c2ab44d0aa19ca977e2e2715ae6969f2f
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 20 18:57:51 2024 UTC

Optimizations

diff | patch | tree

Commit:: bc03c52ea7e3331698d0639a1ebee50b38e88e2e
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 20 18:49:48 2024 UTC

Remove the hashtable, not needed

diff | patch | tree

Commit:: 76606032191318be848eff2c2afe48de3bdd02e2
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 20 18:09:21 2024 UTC

Simplify into single function

diff | patch | tree

Commit:: ce65cacb7ef7342f884331b4d818e71545285496
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 20 18:00:39 2024 UTC

Simplify pathfinding BFS is not actually needed

diff | patch | tree

Commit:: 40d0e7fa0bd499411078dea1a651ddb2d286e9a0
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 20 06:24:58 2024 UTC

Day 20

diff | patch | tree

Commit:: 178cf0b10bd07c4f0b2303b5ee9fc67eea3b40aa
From:: Lukas Henkel <lh@entf.net>
Date:: Thu Dec 19 05:47:31 2024 UTC

Day 19

diff | patch | tree

Commit:: e0211656e194315d0d60c48326eed9977b6860e6
From:: Lukas Henkel <lh@entf.net>
Date:: Wed Dec 18 06:40:00 2024 UTC

Update SBCL

diff | patch | tree

Commit:: 5cd36c441567ae4b5c7bd4bc399e39eea75e1206
From:: Lukas Henkel <lh@entf.net>
Date:: Wed Dec 18 06:34:45 2024 UTC

Reverse task 2 This way is much faster

diff | patch | tree

Commit:: ddf4527960184f991ca2d6abda4882b6c351312e
From:: Lukas Henkel <lh@entf.net>
Date:: Wed Dec 18 05:34:24 2024 UTC

Day 18

diff | patch | tree

Commit:: 0372dbdec3d209ba51f73f4a8572505fed15b415
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 17 10:24:52 2024 UTC

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:: Tue Dec 17 09:09:53 2024 UTC

Day 17

diff | patch | tree

Commit:: 4f33aa74e3fc0f489f1d20fe970de7370eb84f9f
From:: Lukas Henkel <lh@entf.net>
Date:: Mon Dec 16 10:37:00 2024 UTC

Cache expensive node lookup

diff | patch | tree

Commit:: d2acc5d04156c20564f7a69ecb395d930c192279
From:: Lukas Henkel <lh@entf.net>
Date:: Mon Dec 16 07:06:16 2024 UTC

Simplify direction list cycling

diff | patch | tree

Commit:: b80049b66156a9cbb8f881dc7a18b7c4a1642138
From:: Lukas Henkel <lh@entf.net>
Date:: Mon Dec 16 06:53:16 2024 UTC

Day 16

diff | patch | tree

Commit:: 4e6f21582d9227d70475791ac29421d5bf3e4f44
From:: Lukas Henkel <lh@entf.net>
Date:: Sun Dec 15 08:16:21 2024 UTC

Day 15

diff | patch | tree

Commit:: 4a940e998f54d87e8893913334872f90b7a3e73c
From:: Lukas Henkel <lh@entf.net>
Date:: Sat Dec 14 19:46:40 2024 UTC

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:: Sat Dec 14 19:46:15 2024 UTC

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:: Sat Dec 14 19:33:10 2024 UTC

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:: Sat Dec 14 09:39:02 2024 UTC

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:: Fri Dec 13 07:03:35 2024 UTC

Day 13

diff | patch | tree

More ↓