Commit Graph

453 Commits

Author SHA1 Message Date
2907726363 Don't build on Python Nightly
Python nightly doesn't support Numpy, or the other way around, but
either way it doesn't work and causes build failures.
2021-01-24 10:23:20 +01:00
091c125f42 Fix day 8 to paint front-to-back 2021-01-24 10:22:37 +01:00
b65c805891 Implement 2019 day 9 2021-01-24 10:16:14 +01:00
4418292dc4 Implement 2019 day 8 2021-01-23 22:34:58 +01:00
18351f93eb Implement 2019 day 7 2021-01-23 21:33:10 +01:00
fe639f14b3 Implement 2019 day 6 2021-01-23 21:08:27 +01:00
07098ab691 Implement 2019 day 5 part 2 2021-01-23 20:27:30 +01:00
b18945c44d Implement 2019 day 5 part 1 2021-01-23 19:57:48 +01:00
ad3029759a Implement 2019 day 4 2021-01-23 17:52:59 +01:00
7a292b026d Implement 2019 day 3 2021-01-23 17:30:37 +01:00
930d86404d Implement 2019 day 2
Start of the intcode madness
2021-01-23 17:05:10 +01:00
07e869c497 Set up travis for use with Python 2021-01-23 16:15:06 +01:00
07db73aa3e Implement 2019 day 1 with tests in Python 2021-01-23 15:52:12 +01:00
69de955158 Remove C++ solutions 2021-01-23 15:00:04 +01:00
e88ef7b410 Fix final clippy warnings 2020-12-27 23:06:50 +01:00
e9870a1f18 Create timing plots 2020-12-25 11:46:40 +01:00
601d6fdd48 Don't compute unnecessary info. 2020-12-25 10:42:41 +01:00
40a9cb63ff Reimplement test macro as a generic function. 2020-12-25 09:31:44 +01:00
4c3640e994 Fix benchmarks for completed 2020 2020-12-25 09:19:28 +01:00
261628b120 Optimize day 25 with baby-step giant-step 2020-12-25 08:38:21 +01:00
d5d5f97432 Unoptimized implementation day 25 2020-12-25 08:21:19 +01:00
11ceb0b316 Implementation day 24. 2020-12-24 18:58:28 +01:00
d5f35db4ed Implementation day 23 part 2. 2020-12-24 18:21:25 +01:00
3cbc401841 Improve day 22 with Brent's cycle finding 2020-12-23 20:19:49 +01:00
339be73efc Implementation day 23 part 1 2020-12-23 09:25:48 +01:00
5a055b3fb1 Implementation day 22. 2020-12-22 09:12:33 +01:00
e06e77dbad Implement clippy warnings. 2020-12-21 09:35:28 +01:00
74e089cecc Implementation day 21. 2020-12-21 09:30:24 +01:00
3a993419fc Day 20: faster monster finding by looking upside down 2020-12-20 19:58:51 +01:00
68c8b1915d Finally a correct implementation 2020-12-20 19:51:45 +01:00
b443ea7064 Implementation day 20 part 1 2020-12-20 13:08:29 +01:00
cae6b0ed2c Add criterion benchmarks 2020-12-19 12:46:01 +01:00
821ba4089c Implementation day 19. 2020-12-19 10:44:00 +01:00
8ca3018837 Improve code reuse 2020-12-18 19:45:22 +01:00
2d076ff5b9 Fix clippy warnings 2020-12-18 18:52:08 +01:00
9d5019501a Implementation day 18 2020-12-18 18:48:11 +01:00
c666b1f78d Implementation day 17 part 2. 2020-12-17 19:39:22 +01:00
9b064d51ca Implementation day 17 part 1. 2020-12-17 08:52:29 +01:00
308fbc503f Fix misc clippy warnings
Why does it want me to use bytecount? It's not even faster
2020-12-16 20:05:08 +01:00
bd8d525d13 Even more bitsets 2020-12-16 19:43:41 +01:00
b934a268fe Use bitsets for tracking what fits. 2020-12-16 19:13:53 +01:00
54d61e11f1 Optimizations for day 16.
Don't use checks that are idempotent more than once, and reduce hashmap
use.
2020-12-16 19:04:52 +01:00
796d854838 Implementation day 16.
This was a pain.
2020-12-16 09:53:43 +01:00
859034b09d Improve performance day 15
Using 32 bit integers is significantly faster due to better memory
locality, although it requires a bit of casting to move between indices
and values as needed.
2020-12-15 09:10:33 +01:00
3ab0f9711d Implementation day 15 2020-12-15 09:06:17 +01:00
eff0cb9f8c Implement day 14. 2020-12-14 20:06:02 +01:00
fe9dfd163c Implementation day 13 2020-12-13 08:22:35 +01:00
ea839af850 Implementation day 12 2020-12-12 08:00:35 +01:00
7649d628e7 Implemention day 11 2020-12-11 08:20:27 +01:00
190a7e7423 Prepare remaining days. 2020-12-10 21:10:14 +01:00