My solution for day 23...
My solution for day 23...
My solution for day 22... Part 2 in 0,5 sec.
My solution for day 21... Did part 2 by solving one of the Root-monkeys values and then solving the reversed of the leftover-operations with it. Runs in <50ms.
My solution for day 20...
My solution for day 19...
Solved by checking all possible states the mining-process can be in during a given number of minutes and find the maximum number of geodes in all 'endstates' + optimizations to reduce number of states. #AdventOfCode2022 #AoC22 #Kotlin
Late recap on #aoc22:
Fail: far from finishing the whole challenge. I made it to day 10 until sickness catched me. After recovering I lost the motivation.
Success: I wanted to learn #rust. And I did. Now I feel confident to use this language for other projects. I learned enough to have an idea about its strengths and where it might fit.
Last day of Advent of Code! (was yesterday, but Christmas got in the way.) I solved it without calculating the "snafu" number, just manipulating digits like you would in a normal numbering system. My C source code: https://github.com/ednl/aoc2022/blob/main/25.c or see image. The challenge was: https://adventofcode.com/2022/day/25 (needs login, I'm afraid).
Fun little embedded software challenge in today's Advent of Code, with clock cycles and pixel beams. Got it down to 32 lines of C code without comments/blank lines! My solution here: https://github.com/ednl/aoc2022/blob/main/10.c or in attached image.