adventofcode 2020-12-24 | Slack Archive

Fork me on GitHub

euccastro00:12:30

yes, I tried an "optimization" in my 33 minute solution that took it to 45 😛

euccastro00:12: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

Vincent Cantin06:12:13

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

❤️ 9

🕸️ 3

🐝 12

🙏 6

a bit confused on the instructions for part 2

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

Vincent Cantin06:12:01

☝️ 3

ok good to know 🙂

alekszelark13:12:31

https://www.reddit.com/r/adventofcode/comments/kjev7f/2020_day_24_part_2_i_let_it_run_for_10m/

🦀 9

3

💯 3

😆 6

alekszelark13:12:06

Anyone wants to check it? :)))

Vincent Cantin14:12:02

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

😆 3

Vincent Cantin16:12:23

Bestagons found...

Vincent Cantin16:12:27

18

🎯 3

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

alekszelark18:12:02

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.

Vincent Cantin19:12:47

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.