Advent of Code 2020

[JohnWoe]

No other chess programmers solving these puzzles?

I've been solving these without looking any hints.
In Rust language which I'm trying to learn.
Currently at Day 11.

My day 10 part 2 solution: https://github.com/SamuraiDangyo/Advent ... -part-2.rs

[BeyondCritics]

I was burned out after day 16. It felt to me, it had turned mainly into an endless stream of boring exercises in writing parsing code quick, apart from one dynamic programming and one maximum matching, the latter i didn't solved in time, so i got a bit frustrated.
Still it is awful to see, that some are capable of producing solutions within 10 minutes or less.
Write your name in the hall of fame there and you are my hero forever...

[Sesse]

If you want to compete for the top spots, you'll either need to live in a “good” timezone or get up really early in the morning. Not worth it.

[JohnWoe]

Good to see other chess programmers competing!

Days: 10, 11, 12, 13 in the bag!

Day 11 was easy for chess programmers. Not so easy for others

My day 13 solution felt a bit dirty but I got it right. Took me about 3 hours to find the correct algorithm. It cracked in 100ms after that.

I actually like these puzzles a lot.
I'm learning Rust along the way so I'm not fast yet.

To compete I need to wake up at 07:00, not a problem.

Hall of fame fills up pretty fast so I need to hack something dirty in 15min or smt. For 24:th.

[Sesse]

Isn't day 13 part 2 just the Chinese remainder theorem? It can be solved by hand if you wish. Or you can use any of the available online CRT calculators, which will find the answer in a split second.

[AlvaroBegue]

Yes, day 13 part 2 is about the Chinese Remainder Theorem. It was nice to brush up on things I haven't done in over 20 years: Extended Euclid's algorithm, Bézout's identity...