#Advent of Code 2025

90 messages · Page 1 of 1 (latest)

runic ledge
#

Damn @main knot you are hot this year 😎 🔥

main knot
#

@hoary moss fyi 🙂

runic ledge
#

ngl, i watched your day2 for inspiration because i was totally stuck 😄

#

Then i laughed at your p2 of that day, you must have had a good laugh yourself 😄

#

||+||

main knot
#

yeah, it's perhaps not the fastest way but it took about zero time to dream up 😄

runic ledge
#

For todays I had an advantage I believe of doing some hobby ||game dev with grid systems|| that helped alot 🙂

#

But every year is clearly getting harder and harder

grave spire
#

Damn, I gotta get up earlier in the morning 😂

deft ivy
#

for day 2 pt1 i did a ||simple loop and substring comparison|| but then realized i was bein silly and ||used regex|| for pt2

lone orchid
#

Yay, ill post mine later to

#

been so busy but did 3 days so far

main knot
runic ledge
#

todays p2 took me 2,5 hrs

#

😅

main knot
#

ouch. I managed to do both in the hour before I had to go out this morning

grave spire
#

Nice, getting up early on Friday paid off - still ahead of @runic ledge even after a late entry today 😅

image.png
#

(Surely I just jinxed the rest of the week)

runic ledge
grave spire
#

Yeah, took me a while to settle on "least worst brute force implementation" of choice 😭

main knot
#

least worst == first brute force method that worked

grave spire
#

I prefer your description Chris 😁

main knot
#

It'd be nice if I knew a fast way to do all of them. Todays solution was subjectively really slow. I then have to resist the urge to spend the next three hours fiddling with it.

deft ivy
main knot
#

this one ```
1058975-e283bb41

lone orchid
#

and you chopped me up in the printscreen 😄

runic ledge
#

This might jinx rest of the days but... I WILL PRINT THIS OUT AND TELL ALL MY FRIENDS!

image.png
#

||Damn i got stuck on part2 today||

blissful basin
#

So I've managed to get to day7, and I'm failing to follow the example. In my simple mind it is split 22 times but the example says 21.
I'm not asking for the solution, just help in understanding the example.

main knot
#

||One of the splitters is not touched||

blissful basin
#

🤦‍♂️

main knot
#

.|.|||.||.||.|.
|^|^|^|^|^|||^|
|.|.|.|.|.|||.|
|
If you count the splitter here something went wrong

#

heh that did not work. Still trying to make it a spoiler 😄

blissful basin
#

Think I'll go and take the dog for a walk so that my eyes might work again

#

Thank you

main knot
#

giving up on spoilering it. Does not like the combination of chars one bit

blissful basin
#

I haven't even looked at my puzzle input yet, just wanted to understand the sample, so thank you.

main knot
#

it's easy to miss that one, but nothing in the sample hits that particular splitter (there's one above it that prevents that).

runic ledge
#

I see you guys on part2 tips_hat

main knot
#

people keep making me work...

runic ledge
main knot
#

there's a bit of a ||"dammit, geometry"|| thing going on for 2 😄

main knot
#

Feel like I cheated here, I used ||NetTopologySuite|| because I don't know anywhere near enough maths to do ||enclosed polygon's||. It made part 2 rather trivial.

blissful basin
#

Are you talking about day 7 or someother day?

main knot
#

day 9

grave spire
#

Finally had the last meeting of the day and managed to finish pt II without any geom libraries

#

I hope we're done with spatial reasoning puzzles for this year (but experience tells me that's not the case) 😬

main knot
#

heh my first attempt had me checking the ||four corners of the rectangle were enclosed||. Worked for the sample, but my real thing has a ||rectangle crossing a notch||. I was toying with playing around with ||https://rbrundritt.wordpress.com/2008/10/20/determine-if-two-polygons-overlap/||, but at this point that violates the "leave it the hell alone" rule.

Ricky's Microsoft Maps Blog
rbrundritt
Determine if Two Polygons overlap

In order to determine if two polygons overlap we need to iterate through the line segments that make up each polygon and determine if any of the line segments intersect. Once we find a single point…

#

heh hardly the type of problem you run into doing infrastructure coding 😄

grave spire
#

I'm basically doing the inverse - identifying all notches along the edge and then testing whether each possible rectangle overlaps with any of those => discard candidate

main knot
#

didn't think of inverting it... dammit... I wonder how that'd work out for me...

grave spire
#

I hope we're done with spatial reasoning puzzles for this year (but experience tells me that's not the case) 😬
I went back to do all of 2016 in pure PowerShell last week - the last 10 days of the calendar are all just: path-finding, path-finding, fill a 3d space, path-finding, another geometry puzzles disguised as an infeasible combinatorics problem, more 3d space filling, path-finding

main knot
#

I'm only up to day 2 for 2016. It's on maybe one day backlog 😄

grave spire
#

Almost there 😄

image.png
runic ledge
#

Haha i will do rest of the years aswell, i guess its "easy" compared to todays?

main knot
#

No, not really. The difficulty varies quite a lot from year to year. Granted the explanations and samples are certainly a lot better than they were in the beginning too.

Then, for me at least, you just hit the odd puzzle that is seemingly impossible. 2020, day 13, part 2 sticks in my mind there. Part 2 uses an algorithm / theorem that I (still) have no understanding of (||Chinese Remainder Theorem||) and ended up poaching and translating.

I did rather enjoy 2019 (for as far as I've got around to). That was the only one so far where I've felt it necessary to have pester tests for my code.

runic ledge
#

Damn im doing this horrible today

runic ledge
#

Okey that took way to long time

main knot
#

I quite enjoyed part 1, but there's stuff to do at work I'm losing the will to complete part 2

#

part 1 runs in 2.3 seconds, I dunno if I'm missing a trick there to speed it up; my PS code is hardly minimal either since I needed to debug things.

runic ledge
#

2.3 seconds!

main knot
#

is that bad or good? 😉

runic ledge
#

Its so much better than me 😂

main knot
#

hah well I've barely looked at part 2. I guess since there's only 12 days I'm more likely to loop back and fix it up later

runic ledge
#

You know what, its totaly fine!

main knot
#

any correct answer is totally fine

#

it's not like anyone will pull us up on inefficiencies 😄

#

posted part 1 up to GH anyway for posterity

grave spire
main knot
#

part 1 was subjectively fine... 2 is annoying

grave spire
#

Damn, wish I'd tried this sooner 😅 minutes -> 100ms

SPOILER_image.png
#

As opposed to ||attempting to calculate the full paths end-to-end||

main knot
#

oh hey, I was just doing that between working 😄

main knot
#

(in some hopelessly over-engineered way that is)

runic ledge
#

today im full of work 🙁

main knot
#

Yeah likewise. I've done part 1 and I know how to do 2, but I've a bug in my code and no time to fix it.

Plus my approach is slow. I should make it less slow but that needs willingness to hit delete and time to undelete again 😄

I might abandon part 2 for another day again. There's only one of these left now anyway.

shy dirge
grave spire
#

A knapsack problem with polyominos, of course 🫠 Good thing there's 13 days left until christmas 💀

main knot
#

I gave up already. It's a long, long way from being a breakfast problem.

#

maybe if there was no actual work to do 😄

runic ledge
#

day 11 part 2....

runic ledge
#

Okey for part two i did a ||adjacency part first|| and then ||cache everything||

#

||d12 was similar to d11||

grave spire
#

OMG, ||the actual puzzle input for Day12 was much simpler than the example, 15 lines and ~2seconds of brute force later|| 😅

main knot
#

lol