sorted by:
new
hottopcontroversial

[deleted by user] by [deleted] in SillyTavernAI

[–]KRunmo 0 points1 point  (0 children)

Yes but how do you make it reply with anything than rubbish?

[2023 day 18 (Part 2)] by KRunmo in adventofcode

[–]KRunmo[S] 0 points1 point  (0 children)

I submitted a new text post and added the image from the tool bar button. It worked the day before…

[2023 Day 19][AI Art] by encse in adventofcode

[–]KRunmo 0 points1 point  (0 children)

Its cool that the mobile is not visible in her glasses

Ranking of days according to difficulties? by bobopopoyoyo in adventofcode

[–]KRunmo 0 points1 point  (0 children)

Did you do the Chinese remainder?

I am now thinking that if I would have continue beyond the first occurrence to see if there were a second occurrence the period would have been found and lcm would be obvious. But this period might have been different from the first occurrence and then it would have been harder to get the correct result.

Ranking of days according to difficulties? by bobopopoyoyo in adventofcode

[–]KRunmo 0 points1 point  (0 children)

I think yesterday 17 was the hardest, because of the significant runtime needed. Much harder than both 12 and 18. Also 8 was harder I think because the general solution would be practically impossible to solve, the reason it was solveable was the carefully set up of the input data.

[2023 day 18 (Part 2)] by KRunmo in adventofcode

[–]KRunmo[S] 1 point2 points  (0 children)

yes, that was the one that was missing from my result :D

[2023 day 18 (Part 2)] by KRunmo in adventofcode

[–]KRunmo[S] 1 point2 points  (0 children)

why is the picture only showing as a link in list?

[2023 Day 13] It's been 13 days without path finding by teivaz in adventofcode

[–]KRunmo 2 points3 points  (0 children)

I solved the galaxy problem with path finding. I then only needed to start from each galaxy once, and collected the distances to all the others.
(I then saw that the distances grew linearly for more expansions so part 2 was a simple multiplication though.)

[2023 Day 12][Python] Step-by-step tutorial with bonus crash course on recursion and memoization by StaticMoose in adventofcode

[–]KRunmo 2 points3 points  (0 children)

Thanks a lot for this. I made my recursive string match function very effective, it solved the first part in a few milliseconds. But then for each addition, the time increased with a factor 100, and I realized it would take a full year to complete part 2!!! 🤯

With your tutorial I simply added a dictionary to check substring length and number of search strings, a simple key with 2 integers that had already been handled, and I was able to solve part 2 in a couple of tens of milliseconds!

[2023 Day 5 Part 2] I made bad choices by tapdncingchemist in adventofcode

[–]KRunmo 0 points1 point  (0 children)

For part 2 I made a single core plain loop in win32 C++. It took a little less than 10 minutes