adventofcode

Aleks 2020-12-24T13:53:31.141400Z

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

πŸ’― 1
πŸ¦€ 3
1
πŸ˜† 2
Aleks 2020-12-24T13:54:06.141600Z

Anyone wants to check it? :)))

2020-12-24T14:11:02.142500Z

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

πŸ˜† 1
2020-12-24T16:01:23.143900Z

Bestagons found...

2020-12-24T16:01:27.144Z

6
🎯 1
rjray 2020-12-24T17:50:27.146Z

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

Aleks 2020-12-24T18:43:02.147500Z

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.

rjray 2020-12-24T20:58:41.148200Z

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.

2020-12-24T19:36:47.148100Z

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

rjray 2020-12-24T21:01:42.149Z

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

euccastro 2020-12-24T00:47:30.122200Z

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

euccastro 2020-12-24T00:49:45.123Z

@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

misha 2020-12-24T11:38:32.139400Z

Yeah, I saw it in your code, TIL opieop

2020-12-24T06:06:13.125700Z

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

🐝 4
❀️ 3
πŸ™ 2
πŸ•ΈοΈ 1
markw 2020-12-24T06:11:22.127100Z

a bit confused on the instructions for part 2

markw 2020-12-24T06:11:36.127500Z

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

2020-12-24T06:12:01.127800Z

@markw Yes

☝️ 1
markw 2020-12-24T06:12:18.128100Z

ok good to know πŸ™‚