adventofcode 2020-12-24

Anyone wants to check it? :)))

Above 1 million iterations, it's called Crab-coin.

πŸ˜† 1

I'm just crossing my fingers that we don't get another Zork like last year's day 25...

I was too lazy and relaxed to write an algorithm for that, so just I played in it as it was a game, and got my 2 stars in the end.

Same. I used math.combinatorics to generate the sets of items to hold at once. According to last year’s notes, this got me a ranking of 635 on part 1.

For tomorrow’s puzzle, I randomly predict a path finding problem.

I would welcome that. I have plenty of prior art that I can (try to) adapt for that.

yes, I tried an "optimization" in my 33 minute solution that took it to 45 πŸ˜›

@misha there's aset-int too; I got no reflection warnings when using that and no type hints a single type hint on the array itself

Yeah, I saw it in your code, TIL opieop

Good morning. Today, a video about the bestagons. https://www.youtube.com/watch?v=thOifuHs6eY

🐝 4
❀️ 3
πŸ™ 2
πŸ•ΈοΈ 1

a bit confused on the instructions for part 2

are we supposed to use the colors determined from part 1 as the starting point?

ok good to know πŸ™‚