Commits
- Commit:
a757f2ccecb5b65c1c76e6099f2ae82a0d934f08- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 17
- Commit:
4f33aa74e3fc0f489f1d20fe970de7370eb84f9f- From:
- Lukas Henkel <lh@entf.net>
- Date:
Cache expensive node lookup
- Commit:
d2acc5d04156c20564f7a69ecb395d930c192279- From:
- Lukas Henkel <lh@entf.net>
- Date:
Simplify direction list cycling
- Commit:
b80049b66156a9cbb8f881dc7a18b7c4a1642138- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 16
- Commit:
4e6f21582d9227d70475791ac29421d5bf3e4f44- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 15
- 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
- Commit:
a830181c88f262b1facfdc16d53bd1d883a94440- From:
- Lukas Henkel <lh@entf.net>
- Date:
Check for the tree
This way the solution should be more generally applicable.
- 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
- 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.
- Commit:
029cb585a5242f8ac2cf2bd5309519b7dc5f43d8- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 13
- Commit:
9c7d442a8c160ee59e815001d865082616b8bfdc- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 12
- Commit:
9320fac455489ef7263b15f3a6336c7ed34a7934- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 11
- Commit:
7bd93562fa1827db036c3b25cfe787b809b12669- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 10
- Commit:
fbf3f987e153a05c6fed487dfd94c2ce5677b575- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 9
- Commit:
db13595fbfe221cdbdfbe5dd8134ed28f25c8f71- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 8
- Commit:
1af7fd644bbac6ad0c08078a59d37b095fbeca10- From:
- Lukas Henkel <lh@entf.net>
- Date:
Inline some math
- Commit:
dfca954de59ae6453cfc4e6aa21316dbe790a432- From:
- Lukas Henkel <lh@entf.net>
- Date:
Much faster recursive solution
- Commit:
18c13061da0c7b642446e64b7dc1a561c3958fc0- From:
- Lukas Henkel <lh@entf.net>
- Date:
Optimize
- Commit:
58c83f8af7c4abc47f02dc051fd17da85272eb0d- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 7
- Commit:
b70c7b2a5c6627168ec3652c3841e54b97f55bc5- From:
- Lukas Henkel <lh@entf.net>
- Date:
Optimize
- Commit:
db0986abd6d2a985fff0dd0baa13c97a708a6b53- From:
- Lukas Henkel <lh@entf.net>
- Date:
Slight optimization
Check only the spots in task 2 where the guard visited in task 1
- Commit:
c7c064a8bf3e2b6aaaa8c6dc5e00d0553fc20728- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 6
- Commit:
c5b150512827fae8980848c3f48a685db29d3db6- From:
- Lukas Henkel <lh@entf.net>
- Date:
Split parsing
- Commit:
1fa917d31e78f7342ab690a3447ef3ac47c9fcd9- From:
- Lukas Henkel <lh@entf.net>
- Date:
Simplify
- Commit:
eba1e3d671fb248cdf9966ced55805a490815e97- From:
- Lukas Henkel <lh@entf.net>
- Date:
Day 5
