Advent of Code 2021 | Factorio | Page 1

smoky mauve Dec 1, 2021, 5:16 AM

#

https://adventofcode.com/2021/leaderboard/private
Private Leaderboard: 991696-4bb6c2cc

smoky mauve Dec 1, 2021, 5:16 AM

#

smoky mauve <https://adventofcode.com/2021/leaderboard/private> Private Leaderboard: `991696...

pine carbon Dec 1, 2021, 5:17 AM

#

@fluid remnant what's ur part 1/part2 times

fluid remnant Dec 1, 2021, 5:17 AM

#

00:04:16 2 21 00:06:32 1 22 43

pine carbon Dec 1, 2021, 5:18 AM

#

ah

#

I got uh

#

  1   00:00:57    65     36   00:10:54  2713      0

but I think that puts you above me

smoky mauve Dec 1, 2021, 5:19 AM

#

oh wow

#

that leaderboard placement

pine carbon Dec 1, 2021, 5:19 AM

#

thats for global
Im actually
so hype rn

fluid remnant Dec 1, 2021, 5:19 AM

#

wow

smoky mauve Dec 1, 2021, 5:21 AM

#

that delta tho

pine carbon Dec 1, 2021, 5:22 AM

#

I had an off-by-1 due to me misreading the question on part 2

slate sail Dec 1, 2021, 5:41 AM

#

Lol 2 of my friends had that

#

Luckily I didn't

#

How come arson did it faster than abex but got a lower rank?

old tusk Dec 1, 2021, 5:43 AM

#

w += v[i] - v[i-windowsize+1] 🤡

pine carbon Dec 1, 2021, 5:44 AM

#

slate sail How come arson did it faster than abex but got a lower rank?

I believe @fathom grotto or someone finished part 2 before I did, and got the 21 points, so I only got 20 for part 2. I got 22 points for part 1 because I finished first

#

but if you sort by global leaderboard

#

😎 😎

fathom grotto Dec 1, 2021, 5:44 AM

#

It sure woke me up, if nothing else.

pine carbon Dec 1, 2021, 5:45 AM

#

factss

fathom grotto Dec 1, 2021, 5:45 AM

#

Yeah, my time is 1 00:05:54 3356 0 00:10:33 2613 0

#

Barely before you.

pine carbon Dec 1, 2021, 5:46 AM

#

ah damn

#

oh well

#

nice nice

slate sail Dec 1, 2021, 5:46 AM

#

Mine was shit because its 5am and I did not wake up properly in time ~~coping I know~~

#

Well done on your rank 93rd though arson!

smoky mauve Dec 1, 2021, 5:54 AM

#

pine carbon I had an off-by-1 due to me misreading the question on part 2

yeah, I had to double check my math to make sure I didn't have an OBOE

pine carbon Dec 1, 2021, 5:54 AM

#

Thank you! Unfortunately it will not help me get to sleep any faster lol

#

yea exactly

chilly heart Dec 1, 2021, 5:55 AM

#

got distracted and missed the start

pine carbon Dec 1, 2021, 5:55 AM

#

fiddling with the bounds to make it not error cause me to make that mistake

chilly heart Dec 1, 2021, 5:55 AM

#

1 00:52:16 9788 0 00:54:34 8405 0

pine carbon Dec 1, 2021, 5:55 AM

#

nice part 2 timing though

chilly heart Dec 1, 2021, 5:55 AM

#

yeah, i guess

#

easy as shit with python, lol

pine carbon Dec 1, 2021, 5:55 AM

#

way faster than me:)

chilly heart Dec 1, 2021, 5:55 AM

#

more_itertools yo

#

it's fucking cheating

smoky mauve Dec 1, 2021, 5:56 AM

#

I had to think a moment about where to start counting on part 2, especially switching back to a 0-index language

pine carbon Dec 1, 2021, 5:56 AM

#

you don't actually need the sum to do part 2 either lol

smoky mauve Dec 1, 2021, 5:57 AM

#

yep

pine carbon Dec 1, 2021, 5:57 AM

#

I was writing the sum code and thinking

#

"I'm just adding sum to one side and then subtracting it from the other side"

chilly heart Dec 1, 2021, 5:57 AM

#

yeah i'm optimizing now, i just did it quickly

smoky mauve Dec 1, 2021, 5:57 AM

#

you're just comparing i with i-1 and then with i-3

pine carbon Dec 1, 2021, 5:58 AM

#

lesson learned tho, instead of inputs name ins or smth

chilly heart Dec 1, 2021, 6:05 AM

#

ok i got it to one line. lol

smoky mauve Dec 1, 2021, 6:05 AM

#

you doing code golf this year?

pine carbon Dec 1, 2021, 6:17 AM

#

making code look nice

reef ravine Dec 1, 2021, 6:17 AM

#

Whats this lol

chilly heart Dec 1, 2021, 6:17 AM

#

I don't really enjoy the "least number of bytes" approach or whatever

pine carbon Dec 1, 2021, 6:18 AM

#

yea

fathom grotto Dec 1, 2021, 6:40 AM

#

chilly heart got distracted and missed the start

I almost missed the start. Noticed when the task was already up.

fathom grotto Dec 1, 2021, 6:41 AM

#

pine carbon you don't actually need the sum to do part 2 either lol

I actually didn't notice this 😅 Did it the quick and dumb way.

slate sail Dec 1, 2021, 6:43 AM

#

I love that for pt2 it just boils down to a > d

#

I didn't realise until I made my solutions in unreal blueprints

fathom grotto Dec 1, 2021, 6:45 AM

#

In what now?

#

https://docs.unrealengine.com/4.27/en-US/ProgrammingAndScripting/Blueprints/ 🤔

slate sail Dec 1, 2021, 6:51 AM

#

Yup

smoky mauve Dec 1, 2021, 6:52 AM

#

~~now do it with combinators~~

narrow oxide Dec 1, 2021, 11:56 AM

#

part 2 in Rust:
||nums.windows(4).filter(|w| w[3] > w[0]).count()||
optimizes nicely: https://godbolt.org/z/Kv3vYTP76

chilly heart Dec 1, 2021, 6:24 PM

#

Yeah that’s essentially my python solution

old tusk Dec 1, 2021, 6:43 PM

#

C. ||replace 3 with 1 to get the solution for part 1 and make the optimizer think you're on drugs||

pine carbon Dec 1, 2021, 6:49 PM

#

that's a very C solution

old tusk Dec 1, 2021, 6:50 PM

#

K&R would be proud I'm sure

chilly heart Dec 1, 2021, 7:29 PM

#

python
||(ilen(True for w in sliding_window(depths, x) if w[-1] > w[0]) for x in (2, 4))||

ashen tapir Dec 1, 2021, 11:26 PM

#

old tusk C. ||replace 3 with 1 to get the solution for part 1 and make the optimizer thin...

Eww, ligatures

#

Lol y'alls solutions are so elegant

fathom grotto Dec 1, 2021, 11:30 PM

#

Here's an inelegant one for you:||lisp (let ((count 0) prev1 prev2 prev3 next) (with-open-file (input "input") (setq prev1 (read input) prev2 (read input) prev3 (read input)) (loop (setq next (read input nil)) (unless next (return)) (when (> (+ prev2 prev3 next) (+ prev1 prev2 prev3)) (incf count)) (shiftf prev1 prev2 prev3 next) ) ) (print count) )||

#

(spoilered code block still being broken)

ashen tapir Dec 1, 2021, 11:50 PM

#

Is this time based on time after the problem is released, or time after opening the AoC or what?

#

Because the first problem definitely didn't take me 10 minutes lol

chilly heart Dec 1, 2021, 11:58 PM

#

time since release (0500)

#

if you don't start on time, you just gotta flex your time between parts 1 and 2 🙂

ashen tapir Dec 2, 2021, 12:03 AM

#

Ah ok. I didn't start until probably 5-8 after. Dang I could have had a pretty decent score :p (err rank, not score)

chilly heart Dec 2, 2021, 12:04 AM

#

yeah. the first few are usually really hard to get good leaderboard ranks on, because they're so easy

ashen tapir Dec 2, 2021, 12:04 AM

#

how hard do the problems get?

chilly heart Dec 2, 2021, 12:04 AM

#

my best placement in 2020 was on problem 21

#

go look at previous years and see!

#

day 20 was a doozy

ashen tapir Dec 2, 2021, 12:07 AM

#

Oh i see what's going on with p21, part 1 at least doesn't look too bad

#

I'm not entirely sure how I'd structure it, it's a bit like a relational database problem lol

#

oh man 20, that's not fun at all lol

fluid remnant Dec 2, 2021, 12:17 AM

#

I had so many dumb bugs in my day 20 last year. it took forever to make work

chilly heart Dec 2, 2021, 12:20 AM

#

yeah, i made a loooot of mistakes

#

but i got almost the same placement on each, so i wasn't dumber than anyone else:
20 00:42:20 923 0 03:40:25 1082 0

fluid remnant Dec 2, 2021, 12:23 AM

#

I did part1 fast enough, but it wasn't right enough to do part 2 without fixing the bugs so I went to bed

chilly heart Dec 2, 2021, 12:24 AM

#

yeah, i'm on the west coast so it was only 12:40 when i finished

#

guessing a lot of people went to bed though

ancient light Dec 2, 2021, 2:20 AM

#

hm, last year's leaderboard: https://adventofcode.com/2020/leaderboard/private/view/991696

pine carbon Dec 2, 2021, 4:58 AM

#

T-1. I can already feel the impact aoc is having on my sleep schedule lol

ancient light Dec 2, 2021, 4:59 AM

#

you can sleep next year :P

chilly heart Dec 2, 2021, 5:05 AM

#

2 00:03:10 1157 0 00:04:58 866 0

#

meh

#

i don't understand how people even read the problem fast enough to do it

pine carbon Dec 2, 2021, 5:07 AM

#

I got the right answer but negative and lost a minute :(

chilly heart Dec 2, 2021, 5:07 AM

#

didn't try on the test input first? 😦

pine carbon Dec 2, 2021, 5:07 AM

#

gotta go fast

fluid remnant Dec 2, 2021, 5:08 AM

#

I spent > 2 minutes because I made up go down and down also go down

pine carbon Dec 2, 2021, 5:08 AM

#

would've gotten it right if I haven't been a dumbass

smoky mauve Dec 2, 2021, 5:08 AM

#

fluid remnant I spent > 2 minutes because I made up go down and down also go down

lol, gotta check those signs

pine carbon Dec 2, 2021, 5:08 AM

#

u read from the bottom up@chilly heart, then the info is most direct (specific?) to least direct

smoky mauve Dec 2, 2021, 5:09 AM

#

I lost a couple minutes trying to figure out how captures work in python before remembering I could just split the string on the space ¯_(ツ)_/¯

chilly heart Dec 2, 2021, 5:09 AM

#

yeah, fair enough

old tusk Dec 2, 2021, 5:09 AM

#

I hope the tasks don't take five days to get nontrivial

chilly heart Dec 2, 2021, 5:09 AM

#

they usually do

fathom grotto Dec 2, 2021, 5:10 AM

#

chilly heart i don't understand how people even read the problem fast enough to do it

I suspect they don't. I guessed what the problem would be from the first few lines, although I have read it completely anyway in case of something unexpected.

fluid remnant Dec 2, 2021, 5:10 AM

#

I also forgot that rust's split returns an iterator and not a vec which took a second longer than it should have

pine carbon Dec 2, 2021, 5:10 AM

#

I need the five days to make my friends who are bad at coding feel like they didn't die on day 3 heh

chilly heart Dec 2, 2021, 5:12 AM

#

2020d6 was the best for me:
6 01:20:20 11100 0 01:20:34 9571 0

#

14 seconds for part 2! lol

#

I mean you literally just have to change one operator

smoky mauve Dec 2, 2021, 5:13 AM

#

||d25p2 is even faster if you know what to expect||

chilly heart Dec 2, 2021, 5:13 AM

#

just looking at my part1-2 deltas, 2020d10 was the first one that took me >20 minutes for part 2

smoky mauve Dec 2, 2021, 5:16 AM

#

2020d20 was a pain, I eventually got fed up and had to go to sleep

#

I finished d21 before I finished that

chilly heart Dec 2, 2021, 5:19 AM

#

yeah, i got pretty crazy with that one

fathom grotto Dec 2, 2021, 5:19 AM

#

2020d20 was the one that took me most of the day to do (12 hours). I think, I got tired of coding, too, and had breaks throughout it.

chilly heart Dec 2, 2021, 5:19 AM

#

my solution has 9 methods. it has typealiases!

#

it doesn't have any classes though. typealiases are close i guess

#

            if rotate == 0:
                r = [x for x in t]
            elif rotate == 1:
                r = [list(reversed(x)) for x in z]
            elif rotate == 2:
                r = [list(reversed(x)) for x in reversed(t)]
            elif rotate == 3:
                r = [x for x in reversed(z)]

#

part of my 2020d20 solution. lol

#

i'm kinda impressed with how ridiculous my solution is

#

i could do it WAY better if i spent some time on it

fluid remnant Dec 2, 2021, 5:23 AM

#

mine had this clusterfuck in it https://github.com/abextm/advent-of-code/blob/master/20/src/day20.rs#L237-L253

chilly heart Dec 2, 2021, 5:25 AM

#

i actually think it might be nice-ish to do in a vector/matrix oriented language

#

someone can probably do it in like 20 lines of matlab

#

or maybe julia nowadays, but yeah

fluid remnant Dec 2, 2021, 5:25 AM

#

probably yeah

chilly heart Dec 2, 2021, 5:28 AM

#

day 18 was a good one too. i did it first the hard way, then the silly way (replace operators in the string with ones that have the precedence you want, parse to AST, change the operators back in the AST, then eval)

slate sail Dec 2, 2021, 5:30 AM

#

I'm so mad, I could have done part 1 in 5 minutes but I fooked up my variable naming so got confused and so got it wrong twice causing a 5 min timeout, my delta for p2 was 2:27 though so I'm happy about that

fathom grotto Dec 2, 2021, 5:30 AM

#

chilly heart ```python if rotate == 0: r = [x for x in t] ...

Mine is operating on edges, with a tiny inline lookup for rotation. E.g. lisp (setq bottom-edge (aref (car (gethash index tiles)) (if flipped (case rotated (0 1) (1 2) (2 3) (3 0)) (case rotated (0 2) (1 3) (2 0) (3 1)) )))

chilly heart Dec 2, 2021, 5:31 AM

#

nice one

fluid remnant Dec 2, 2021, 5:31 AM

#

for 18 I just made a tokenizer and then eval'd it with a shunting yard

fathom grotto Dec 2, 2021, 5:31 AM

#

2020d20p2 is also probably my most commented AoC code ever.

chilly heart Dec 2, 2021, 5:32 AM

#

mine has no comments. looking at it now is making my head hurt

ancient light Dec 2, 2021, 5:33 AM

#

fathom grotto 2020d20p2 is also probably my most commented AoC code ever.

same here, but re-reading those same comments a year later and they only make 50% sense 😹

fathom grotto Dec 2, 2021, 5:35 AM

#

Mine all make sense to me. Remind me how exactly it works, even.

chilly heart Dec 2, 2021, 5:37 AM

#

meanwhile mine is itertools-heavy code without comments

#

i've trolled myself, basically

fathom grotto Dec 2, 2021, 5:37 AM

#

fluid remnant for 18 I just made a tokenizer and then eval'd it with a shunting yard

TFW your language has a built-in tokenizer 😎

#

(that's what read actually is in Lisp, same thing it uses to read your code)

#

Makes some tasks easier, like today's one. I literally just read the action and argument without having to do any input recognition.

#

God forbid there being any commas in the input though.

#

(although I guess I could bypass it with a custom readtable, I don't use them nearly as often as I could have)

#

My usual response to a comma-separated list is reading it all as a string, replacing all commas with spaces, wrapping it in parentheses and reading a list normally from the resulting string.

fathom grotto Dec 2, 2021, 5:50 AM

#

fathom grotto Mine is operating on edges, with a tiny inline lookup for rotation. E.g. ```lisp...

The pattern recognition part is a bunch of copypaste though (for all rotations) 🤔
For some reason I didn't make it into a closure.

#

Yeah, running it through compare, the only difference is the rotated pattern variant.

chilly heart Dec 3, 2021, 5:27 AM

#

I didn't do well on that one at all

#

premature optimization in part 1 screwed me

pine carbon Dec 3, 2021, 5:28 AM

#

same, definitely not my best

#

so much words too

fluid remnant Dec 3, 2021, 5:28 AM

#

yeah

chilly heart Dec 3, 2021, 5:30 AM

#

for step 1, I just counted the numbers of 1 in each column and just chose 1 if it was more than half the # of lines

#

that approach does... not work in p2

pine carbon Dec 3, 2021, 5:30 AM

#

the real question is

#

how do I generalize o2 and co2 finding

#

cause it's one conditional

fluid remnant Dec 3, 2021, 5:30 AM

#

I just put it in a method passed a bool for which one it was

#

and xored it in the condition

smoky mauve Dec 3, 2021, 5:34 AM

#

got caught up on the terminating condition for the second part of p2

#

with the CO2 scrubber, a single element would remove itself (since it's the most common value) and I didn't check for when there was only 1 number left

fathom grotto Dec 3, 2021, 5:46 AM

#

I took way too long with this task. Needed to look up so many things. Shows how poorly I know Common Lisp stdlib, I guess.

opaque carbon Dec 3, 2021, 5:46 AM

#

I tried putting the story into a comment and having Copilot write the solution

#

It worked reasonably well in that copilot gained a lot of context, but not so much in solution correctness

fathom grotto Dec 3, 2021, 5:46 AM

#

And p1 turned out completely different from p2 the way I approached it.

fathom grotto Dec 3, 2021, 5:48 AM

#

chilly heart for step 1, I just counted the numbers of 1 in each column and just chose 1 if i...

I did this.

chilly heart Dec 3, 2021, 5:48 AM

#

I actually think of the easiest ways might be a shell script that greps in a loop

#

Would make a ton of files, but lol

pine carbon Dec 3, 2021, 5:49 AM

#

best sol for part 1 is matrix transpose

#

:)

chilly heart Dec 3, 2021, 5:49 AM

#

Yeah basically. Haha

fathom grotto Dec 3, 2021, 5:49 AM

#

chilly heart Would make a ton of files, but lol

Only 12 files, no? For the number of digits.

chilly heart Dec 3, 2021, 5:50 AM

#

2^n since you’re splitting each time

#

Oh wait, I guess that’s not true

fathom grotto Dec 3, 2021, 5:50 AM

#

But you don't need the other part.

chilly heart Dec 3, 2021, 5:50 AM

#

Right, yeah. Haha

slate sail Dec 3, 2021, 6:10 AM

#

I discovered this lovely thing called Counter from collections and simplified my code a LOT

reef ravine Dec 3, 2021, 6:13 AM

#

if A does not = B, remove U235

night star Dec 3, 2021, 6:29 AM

#

def day3a(inparr,mode):
    fun = [float.__lt__,float.__ge__]```
fun!

slate sail Dec 3, 2021, 12:01 PM

#

chilly heart that approach does... not work in p2

Part 2 was quite similar to part 1 for me, pretty much just an added step for the bit criteria

pine carbon Dec 4, 2021, 5:21 AM

#

hype hype

#

bingo time

smoky mauve Dec 4, 2021, 5:43 AM

#

there's a squid attached to the sub!

#

it probably just wants to play bingo

#

like those crabs that hopped on the raft to play War last year

fathom grotto Dec 4, 2021, 5:47 AM

#

This one was pretty easy, especially part 2. Took a long time to code though.

fathom grotto Dec 4, 2021, 5:48 AM

#

smoky mauve like those crabs that hopped on the raft to play War last year

There was only one crab, IIRC, and it was small.

smoky mauve Dec 4, 2021, 5:50 AM

#

oh, true

#

after losing to it you had to make up Recursive War

fathom grotto Dec 4, 2021, 5:52 AM

#

especially part 2
(although I have still managed to confuse myself as to ||what single condition check I need to change|| and took an entire two minutes to do it)

fathom grotto Dec 4, 2021, 5:54 AM

#

smoky mauve after losing to it you had to make up Recursive War

inb4 Recursive Bingo engithink

smoky mauve Dec 4, 2021, 5:58 AM

#

I liked the rule in Recursive War where if you reached a stalemate the tie went to you and not the crab

#

no wonder he got angry and challenged you to a different game

slate sail Dec 4, 2021, 6:00 AM

#

fathom grotto This one was pretty easy, especially part 2. Took a long time to code though.

Kidding, right? Took me 30 minutes to just parse the boards lol

fathom grotto Dec 4, 2021, 6:01 AM

#

Took me 20 minutes for that, but that is hardly a complicated task.

smoky mauve Dec 4, 2021, 6:01 AM

#

it was just a bit tedious

fathom grotto Dec 4, 2021, 6:01 AM

#

Exactly.

#

(well, you can always reformat your input into a data structure init if you want to go faster)

slate sail Dec 4, 2021, 6:08 AM

#

Fucking finally, done pt1

night star Dec 4, 2021, 6:19 AM

#

I spent about 20 minutes debugging while thinking the winning board points are the sum of the winning column/row multiplied by the current number ChibiYelling

#

really need to read slower next time

#

hm, can't spoiler a three tick code block, huh

fathom grotto Dec 4, 2021, 6:24 AM

#

You can, but it looks awful.

#

Blame Discord.

night star Dec 4, 2021, 6:29 AM

#

tried to put more effort into applying list comprehension

📎 aoc21d4.py

slate sail Dec 4, 2021, 7:02 AM

#

Damn that's a smart way of doing it

chilly heart Dec 4, 2021, 7:29 AM

#

i know we're not doing code review, but

for i in range(len(boards)):
    board = boards[i]

can be written as

for i, board in enumerate(boards):

#

which, incidentally, is a line in my (otherwise significantly different) solution

night star Dec 4, 2021, 7:31 AM

#

yes review my code please, because TIL about enumerate

chilly heart Dec 4, 2021, 7:32 AM

#

it's super useful and lots of people don't know about it

night star Dec 4, 2021, 7:32 AM

#

it's like I'm missing on how to do for k,v in pairs() but in py

chilly heart Dec 4, 2021, 7:32 AM

#

for k, v in somedict.items():

night star Dec 4, 2021, 7:33 AM

#

oh. right, i can do that too

chilly heart Dec 4, 2021, 7:33 AM

#

I did some stuff with set math

📎 day04.py

#

and yeah, I'm aware there are some optimizations i should make. but it's a totally different approach from yours 🙂

#

and yes, my familiarity with list comprehensions is such that i did that instead of remembering how to index with steps 🤦

night star Dec 4, 2021, 7:39 AM

#

ooh yeah getting the unmarked numbers by subtracting the marked ones, that's great

#

x for i, x in enumerate(board) if i % 5 == n this! I forgot how to do that conditional

chilly heart Dec 4, 2021, 7:42 AM

#

ahaha

night star Dec 4, 2021, 7:42 AM

#

my mind laser-focused on the word WHERE

chilly heart Dec 4, 2021, 7:42 AM

#

yes, the not stupid way to write that is simpler:
set(board[n:-1:5])

#

i was just brainfarting at the time

night star Dec 4, 2021, 7:43 AM

#

well, uh, I'm learning here ChibiHappy

chilly heart Dec 4, 2021, 7:43 AM

#

but yeah, with list comprehensions you can basically turn any python script into a single line

#

it'll be incomprehensible (list incomprehensions, amirite?!), but it's entertaining

ancient light Dec 4, 2021, 7:52 AM

#

hm, i should figure out how spoiler tags work

chilly heart Dec 4, 2021, 7:54 AM

#

can't do spoilers with triple-backtick, so it's a bit subpar for posting code

ancient light Dec 4, 2021, 7:54 AM

#

Please note that text marked as Spoiler within code blocks will not be hidden.

#

yeah, i just read the documentation to find that out :P

chilly heart Dec 4, 2021, 7:54 AM

#

attaching files works because they're collapsed, so as long as the first few lines aren't interesting...

vapid galleon Dec 4, 2021, 11:46 AM

#

A lot of code in this one

📎 day4.py

#

Missed some type hints smh

reef ravine Dec 4, 2021, 12:39 PM

#

local Debug = true

if debug == true then
print("Debug Screen")
end

fathom grotto Dec 4, 2021, 1:32 PM

#

A lot of step-by-step solutions (and a lot of Python solutions 🤔 ). I went with something simpler, if perhaps less optimal.

📎 part1.lsp

night star Dec 4, 2021, 2:13 PM

#

too bad discord can't display that directly lol

fathom grotto Dec 4, 2021, 2:21 PM

#

It works as a spoiler 😛

night star Dec 4, 2021, 5:44 PM

#

slate sail Damn that's a smart way of doing it

which part? I'm curious now ChibiHappy

slate sail Dec 4, 2021, 5:45 PM

#

night star which part? I'm curious now <:ChibiHappy:448119648576077825>

Using OOP and not brute forcing with quintuple nested for loop

#

So, I guess it's actually the lack of being a fool that made me exclaim that

night star Dec 4, 2021, 5:50 PM

#

wait, five for loops?

lean karma Dec 4, 2021, 6:19 PM

#

in case anyone's interested (spoilers):
https://github.com/tzwaan/advent-of-code/tree/master/2021/day4

GitHub

advent-of-code/2021/day4 at master · tzwaan/advent-of-code

Advent of Code solutions in python. Contribute to tzwaan/advent-of-code development by creating an account on GitHub.

night star Dec 4, 2021, 6:31 PM

#

walrus!

lean karma Dec 4, 2021, 6:31 PM

#

walrus?

night star Dec 4, 2021, 6:31 PM

#

:=

lean karma Dec 4, 2021, 6:31 PM

#

oh, right

#

that's what it's called

slate sail Dec 4, 2021, 6:40 PM

#

night star wait, five for loops?

At least it isn't as bad as my 2020 day 17 solution that went up to 12 nested for loops

lean karma Dec 4, 2021, 6:41 PM

#

have you heard about this thing called a function?

slate sail Dec 4, 2021, 6:41 PM

#

It was funny

#

def lifeRound(grid):
    newGrid = {}
    for xAxis in range(min(x[0] for x in grid.keys()) - 1, max(x[0] for x in grid.keys()) + 2):
        for yAxis in range(min(y[1] for y in grid.keys()) - 1, max(y[1] for y in grid.keys()) + 2):
            for zAxis in range(min(z[2] for z in grid.keys()) - 1, max(z[2] for z in grid.keys()) + 2):
                for wAxis in range(min(w[3] for w in grid.keys()) - 1, max(w[3] for w in grid.keys()) + 2):
                    cube = grid.get((xAxis, yAxis, zAxis, wAxis), False)
                    neighbours = checkAdjacent(xAxis, yAxis, zAxis, wAxis, grid)
                    if (cube and neighbours in (2, 3)) or (not cube and neighbours == 3):
                        newGrid[(xAxis, yAxis, zAxis, wAxis)] = True
    return newGrid

def checkAdjacent(row, column, depth, w, grid):
    neighbours = 0
    for dx in (-1, 0, 1):
        for dy in (-1, 0, 1):
            for dz in (-1, 0, 1):
                for dw in (-1, 0, 1):
                    if dx == dy == dz == dw == 0:
                        continue
                    if grid.get((row + dx, column + dy, depth + dz, w + dw), False):
                        neighbours += 1
    return neighbours

def setGrid(lines):
    grid = {}
    for row, line in enumerate(lines):
        for column, depth in enumerate(line):
            grid[(row, column, 0, 0)] = depth == '#'
    return grid

def main():
    start = time.time()

    # Execution time: 242.5s
    lines = [line.rstrip('\n') for line in fileinput.input("Day17Input.txt")]
    grid = setGrid(lines)

    for i in range(0, 6):
        grid = lifeRound(grid)
    print(sum(grid.values()))

    end = time.time()
    print(f"Executiont time: {end - start}")

main()

lean karma Dec 4, 2021, 6:41 PM

#

oh boy

slate sail Dec 4, 2021, 6:44 PM

#

It only took 250s to run!

pine carbon Dec 4, 2021, 6:56 PM

#

night star Dec 4, 2021, 7:04 PM

#

Is that basically 4D game of life?

#

oh yeah
it is

smoky mauve Dec 4, 2021, 7:07 PM

#

yep

#

2020d17 was 3/4D Game of Life

#

2020 had a couple different versions of Game of Life

#

line of sight, 4D, and hexagonal

night star Dec 4, 2021, 7:13 PM

#

constrained within six cycles, I'd rather make some sort of ActiveCell class and iterate over them rather than iterating over every single cell, because there'll be so much more empty space as dimension increases

#

oh wait fuck the births right

smoky mauve Dec 4, 2021, 7:15 PM

#

since the starting board is 2D, one optimization (that I think the prompt even suggests) is that the results will be symmetrical

#

ie the board for z=-1 is identical to the board for z=+1

fathom grotto Dec 4, 2021, 8:10 PM

#

lean karma in case anyone's interested (spoilers): https://github.com/tzwaan/advent-of-code...

Diagonals don't count.

slate sail Dec 4, 2021, 8:11 PM

#

Good thing it doesn't effect the answer

fathom grotto Dec 4, 2021, 8:11 PM

#

affect*

slate sail Dec 4, 2021, 8:12 PM

#

Thanks, I never get it right

fathom grotto Dec 4, 2021, 8:12 PM

#

Verb is "affect", noun is "effect".
(there is a verb "effect", but usage is extremely niche)

#

And there probably is an input where diagonals would have mattered.

slate sail Dec 4, 2021, 8:13 PM

#

I've been told/taught this as long as I can remember and it still never clicked as to when I need to use one or the other on demand without spending a few minutes trying to remember which one is which lol

chilly heart Dec 4, 2021, 8:15 PM

#

fathom grotto Verb is "affect", noun is "effect". (there is a verb "effect", but usage is extr...

affect can be a noun as well

fathom grotto Dec 4, 2021, 8:16 PM

#

Yes, but people confuse that with "effect" less often.

#

And it has different meaning.

lean karma Dec 4, 2021, 8:17 PM

#

fathom grotto Diagonals don't count.

oh, interesting, I hadn't noticed that

#

got the correct answer anyway :p

chilly heart Dec 4, 2021, 8:17 PM

#

And it’s even more obscure than effect as a verb

spare fiber Dec 5, 2021, 1:36 AM

#

good to know this exist

chilly heart Dec 5, 2021, 1:37 AM

#

in response to your comment in #offtopic - if you think day 4 was hard, just wait

#Advent of Code 2021