This year I explored Elixir early in the year and Common Lisp later in the year. My loose goal was to answer all puzzles using Common Lisp while looking for any BEAM/OTP opportunity (highly concurrent processing) that would warrant an Elixir run. Alas, it was mostly Common Lisp.
I say that with a little regret: Elixir was a refreshing pleasure when twice I pulled it out. With neither fluency in the language nor familiarity with any helpful libraries, Common Lisp was challenging -- maybe more so than Haskell last year.
The event was only 12 Days this year. A hiccup on Day 9 or 10 combined with some family activities put me behind. Completed the work on 15 December.
FWIW, the commaraderie and approach sharing on Reddit is wonderful, but the technical moderation is a real bucket of cold water. Next year, maybe I'll skip it.
URL: https://adventofcode.com/
| Day | Title | Comments | Language | Part 1 | Part 2 |
|---|---|---|---|---|---|
| 1 | Secret Entrance | Modulo / Floor Division Arithmetic | CL | ✅ | ✅ |
| 2 | Gift Shop | Smarts > Brute Force | CL | ✅ | ✅ |
| 3 | Lobby | Greedy sequence processing | CL | ✅ | ✅ |
| 4 | Printing Department | Iterative Grid or List Reduction until Stable | CL | ✅ | ✅ |
| 5 | Cafeteria | Efficient Counting / Ranges | CL | ✅ | ✅ |
| 6 | Trash Compactor | Complex Input Parsing. Bonus: EVAL! | CL | ✅ | ✅ |
| 7 | Laboratories | Single-Pass State Changes / Path Counts | CL | ✅ | ✅ |
| 8 | Playground | Set Union-Find | Elixir, CL | ✅ | ✅ |
| 9 | Movie Theater | Grid, Non-Convex Circuit-Bounded Shape, Contained Areas | CL | ✅ | ✅ |
| 10 | Factory | Constrained BFS. Constrained Linear Algegbra (RREF, Free Variables, Explore) | CL | ✅ | ✅ (13 Dec) |
| 11 | Reactor | Paths through a Graph | Elixir (P1), CL (P2) | ✅ (13 Dec) | ✅ (14 Dec) |
| 12 | Christmas Tree Farm | 2D Space Packing / Check the Data! | CL | ✅ (15 Dec) | ✅ (15 Dec) |