Hello together, here I post my work on the advent of code. :D
It takes 143 complete iterations to get to a doubled value :)
It took a while to understand, what the hash sum is supposed to be. You are not supposed to count every letter just once (maximizing the hash sum at 26^2 but instead only count every ID once for having two and once for having three letters occuring. D'oh.
Solved it completly unoptimised. Hacked together a solution :/ It takes len(lines)^2 + len(lines) * id.x_length * id.y_lenght as it is not optimised. There is probably a solution using only a single loop, but i can't wrap my head around it using only lists, dicts, booleans, strings and integers. :(
Sad panda is sad. No solution today. I can't quite grasp the problem it seems.
Reading the assignment would help a lot in improving time to produce a solution. -.-
Took me forever to solve the first problem. Pretty sure I wasn't deciding whether a coordinate was infinite or not. Yet with the help of reddit, I got it working. And afterwards, getting Part II was like adding 7 lines of code and took like 2 minutes. I'm pretty happy about that :)
Reading the assignment would be helpful again. I was not checking all available tasks alphabetically but just the available ones in this task tree at first. Figured the solution out afterwards pretty quickly and the part II was fairly easy afterwards :)
This one was pretty easy and straight forward. :)
The first part was pretty straight forward, for the second part, the puzzle input was extremly large and my first solution would have taken probably about an hour to determine the solution. With the help of reddit, I updated to deque and it run super fast. :)
Short update: My naiive solution takes 2.5h to process 1.4 million marbles. It seems like this would be no good use for the handheld you took with you to save christmas :D
Was sick and also had no idea how to solve the problem.
Learned some numpy today :)
Puzzle was a type of Game of Life. The most confusing was I had to add the negative indices as well, which was not coming out of the instructions initially. Luckily, this time I'm not the only one having this problem :D
As usually since day 9, I had to get help with the approach to part II, solving it afterwards was pretty straight forward :)
I'm kinda sick, it's kinda late, but I took the last two hours to solve the first part of todays puzzle. I hate not being able to determine left from right -.-
Part I was pretty straight forward, Part II took me a while. Reddit helped again, my solution of using Strings was inefficent.
Whilst I got the right solution on the example input, I guess my a* runtime takes to long on the 30x30 grid of the puzzle input. How unforetunate, I thought that might be a fast algorithm :(
Fun little puzzle
Part II was obviously impossible to brute force, so I looked at the first 1000 Values and notices, that as of somewhere 700ish, values repeat. So I used to check in the range of 800:829 if a value is equal to 799, if so, it means it takes this long to go through a season, therefore, I can than calculate int((1000000000-800) / length_of_season % 1 x length_of_season). If I then add 800, I get an index of a product that is equal to the one 1000000000 has :)
Can't wrap my head around part II. I uploaded my input this time, as you have to reverse engineer it in part II.
I tried to get all possible ways from the regex, which was quite complicated, so instead, i build a cartesian coordinate system with (0,0) being the startpoint and each step adding a door and a coordinate in the system. A dict with the coordinates as key and a list of doors as value then got sorted by the maximum value of the minimum of each list. :)
Yey, I'm in place 613 for part I :) Hard puzzle, you had to somewhat understand the condition, on which the program determinates by going through the source.
Part II took 65 minutes of calculation. I think my source is suboptimal, as one could easily use less instructions for the loops, but I didn't :D
Could only beat the first puzzle. My CS-Knowledge isn't good enough for a custom shortest path algorithm on diverse contraints. Maybe on another day.
Got rank 435 on part I. Second part was solved thanks to the code of reddit user /u/seligman99 which took a little adjustment for me to work. Also I had the right idea, I did not know how to implement it properly. Therefore my ranking at this challenge is not representative and so my best ranking still is 1173 :(
It's christmas today and I'm glad, reddit could help me with this one. If an unit dealt a maximum of 0 damage to all enemies, it should not select an enemy as target. :)
Part II was a binary search optimization problem.
Took another go at the 10th December, as I had time today. I read some user at reddit got a working solution by minimizing the bounding boxes of the input, so I did the same using numpy :)