summaryrefslogtreecommitdiffstats
path: root/solutions/input
Commit message (Collapse)AuthorAge
* Rename 2019Gustav Sörnäs2019-12-17
|
* WIP Day 17 pyGustav Sörnäs2019-12-17
| | | | | Can solve part 1 and find a naive instruction-set which passes all points.
* Day 14 pyGustav Sörnäs2019-12-16
|
* Day 16 pyGustav Sörnäs2019-12-16
| | | | Runtime is shit, about 20-30 seconds on a ryzen 2600
* WIP Day 14 (working pt1)Gustav Sörnäs2019-12-16
|
* Day 15 pyGustav Sörnäs2019-12-16
|
* Day 15 py (not working)Gustav Sörnäs2019-12-15
| | | | oof
* Remove test-casesGustav Sörnäs2019-12-13
|
* Day 13 pyGustav Sörnäs2019-12-13
|
* Day 12 pyGustav Sörnäs2019-12-13
|
* Day 11 pyGustav Sörnäs2019-12-11
| | | | | | | | | | | I found a bug in my intcode-implementation which day 9 didn't catch. To solve it, I switched the memory from my past hybrid solution (initial memory as a list and extra memory as a dict) to a 100% dict-solution. I am not entirely sure why it didn't work before since Computer.write() checks if the write-position is outside the length, unless it got a negative address. It seems like dict is slower than list for memory so I might try to re-implement lists for (initial) memory later.
* Day 10 pyGustav Sörnäs2019-12-10
|
* Day 9 pyGustav Sörnäs2019-12-09
|
* Refactor and create main.pyGustav Sörnäs2019-12-08
|
* Day 8 pyGustav Sörnäs2019-12-08
|
* Day 5 pyGustav Sörnäs2019-12-07
|
* Day 7 pyGustav Sörnäs2019-12-07
|
* Day 6 pyGustav Sörnäs2019-12-06