advent-of-code VS aoc2020

My solution in Common Lisp.

Dot file generated by my code and then run through fdp from Graphviz.

Just a simple relief-shaded image like you might find on a map. Principally generated with GDAL. The particular commands used are at the bottom of my solution code for the day. I also made a more flat version, which shows the elevation colors better, but really doesn't feel right in terms of elevation.

The code is written in Common Lisp using Cairo and ffmpeg. https://gitlab.com/asciiphil/advent-of-code/-/blob/master/2022/09.lisp

So I spend more time analyzing the input calculation. I wrote up that analysis and committed it to my repository, too.

This was a bit difficult. My original part one solution worked completely differently to what I had to do for part two.

My solution in Common Lisp, 2335/2041.

No. It's just here, as part of my Advent of Code repository.

The code is at the bottom of my day 9 source file, in Common Lisp. (The AdvMAME3x code was something I originally wrote for my 2020 day 20 visualization.)

As a side note, I took inspiration from a post the other day about adding AoC badges to your repository README file. I use GitLab, which lets you define badges as properties of your repository. So I added badges to my repository's header area, driven by a JSON file in the repository. The JSON file is updated manually by a script. (I might add some automated updates at some point, but manual works okay for now.)

I got all but one star in 2020 when I did it in Python: https://github.com/ednl/aoc2020 but I'm afraid there may be some short variable names despite not doing it for speed.

I liked my solution for https://adventofcode.com/2020/day/17 Game of Life in 3D and 4D: https://github.com/ednl/aoc2020/blob/main/day17.py

Day 8 runs in 0.02 s using python 3.9 on my M1 Mac Mini. Just flipping in part 2, no special optimisation. My code: https://github.com/ednl/aoc2020/blob/main/day08.py

Yep, linked above, or: https://github.com/ednl/aoc2020/blob/main/day15.c

Good that you got it working! My version in C is a bit shorter, perhaps you could use some ideas for the next puzzles? I like the dynamically sized getline() function, for instance: https://github.com/ednl/aoc2020/blob/main/day06.c

Here is my C version with lots of built-in checks: https://github.com/ednl/aoc2020/blob/main/day03.c

Day 23 part 2 in 0.06 s on a dual core 1.3 GHz i5 Haswell (2013 MB Air) https://github.com/ednl/aoc2020/blob/main/day23.c because of a simple array as a linked list.

Day 23 part 2 (1 million cups, 10 million moves) runs in 0.06 s on my 2013 dual core Haswell i5 1.3 GHz. Main reason is a super fast simulated linked list via a pre-allocated array of integers. Source https://github.com/ednl/aoc2020/blob/main/day23.c

Thanks to /u/thomasahle for encouraging me to implement axial coordinates, which made it a lot easier. Also thought of a better way to parse the input in one go. And this allowed me to tighten up the grid dimensions. Runs in under a second on a very old laptop, half of which is because of the scipy import ... https://github.com/ednl/aoc2020/blob/main/day24alt2.py