aoc-22-18 VS advent_of_code

github - Part 1 is pretty easy - Part 2 I created an inverse cube of the original shape, like a mould for a silicone thing and used the algorithm in part 1 to calculate the sides of the inverse. I just needed to remove the outer sides of the inverse cube to get the solution - To create the inverse, I started from 2 opposite corners of the "bounding box" of the original shape and added a neighbour if it's within bounds and isn't part of the original shape. - With this solution you need to be aware of "hooks" while generating the inverse

Just solved it analytically on paper and then implemented the equation because I didn't have a proper calculator at hand. Honestly though, even just using the builtin MacOS calculator would've been faster in the end...

Yeah, it's what I thought too. But frankly, it took me all day to get this much out of my fogged brain, so I took the win I got.

Even though I had the visual aid I needed to go over the entire thing like 4 times and double check all the wraps that actually occur to make sure it's actually correct. Not difficult, just really tiring and tedious. Anyway, because it was asked for, here are the sketches I made while figuring it out.

Haskell

Haskell (Realistically only part 1)

Had part 1 almost first try, and then struggled a bit understanding part 2 correctly. Once I did, it wasn't too bad to adjust what I had to work with any number of knots, only thing that tripped me up for a bit was that I was missing the outer corners for "updateTail" as they can't happen in part 1, but will happen in part 2.

Haskell (Part 1 only)

Code here, does anyone maybe have an idea what's going wrong?

Can anyone give me an indicator where I'm going wrong? Code here, but it's basically unreadable, so I'm not sure if that's gonna be much of a help. I can say that it correctly enables me to deduce the position of scanner 1 relative to scanner 0 from the example, so I must be doing something sort of right.

Haskell