advent21 VS adventofcode

You can try to read my walkthrough... You cannot just match one edge to another edge, as there may be match in magnitude but are in fact totally off. You have to test for all edges, and you'll eventually know if two scanners line up if there's more than just two 'lucky' points (i.e. edge) that exists for both scanners.

Nim with my walkthrough here. Similar to the other solutions, just brute-forcing all possible moves for Dijkstra's algorithm. My walkthrough simply explains how to figure out the valid moves to do so, turns out it isn't too hard after having written it down (and simplifying my code).

Code on GitHub is currently a mess.

In the spirit of the Day 5 ALLEZ CUISINE! challenge to ELI5 (Explain Like I'm Five), here's a tasty explanation of how my algorithm works using only a large bucket of Red Vines and a knife. It says to use lined paper, but if you try this at home consider aligning things on a cutting board.

[Language: Jsonnet] (on GitHub)

Elixir code, thoughts

Elixir 1554/1502 code, reflections

Elixir 2506/3402 (24 minutes, 2 hours), code, thoughts

Bonus solution in Go (golang) because I was confused about why my Elixir solution didn't work and decided to implement from scratch in case I'd done something dumb. The Go one also got the wrong answer, but took less than 100ms instead of a minute, so I could try out lots of tweaks that didn't change the answer.

Elixir 2031/2641 after 3.25/6.5 hours! Code on GitHub

I spent time this afternoon sprucing up my helpers for the iex REPL. I spent a bunch of time poking at things in IEx the last couple days and wanted to make sure I would minimize keystrokes if I needed to debug things on my phone while drunk. Turns out Thursday night > Friday night > Saturday night in terms of difficulty, so all those macros have so far saved me zero seconds :-)