From c0a6145019a0212261ec96e522af84f40d387dd7 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Stefan=20M=C3=BCller?= Date: Wed, 26 Jun 2024 21:23:04 +0200 Subject: [PATCH] Added favorites in readme --- README.md | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 86cbe86..9b47726 100644 --- a/README.md +++ b/README.md @@ -14,6 +14,10 @@ On day 3, I introduced unit tests to help troubleshoot issues and prevent regres I also added tests for the full puzzle data once I found the solution, but these tests are not public to not spoil the Advent of Code puzzles. +## My Favorites + +While I think all the puzzles were a lot of fun, some of them became my favorites, marked with a star :star:, because I enjoyed the puzzle itself or was particularly content with my solution algorithm. + ## Solutions ### Day 1: Trebuchet?! @@ -74,7 +78,7 @@ Again a puzzle where I had to read in all of the data before starting the algori Part 2 was a bit sneaky. This is the first puzzle where the result is outside the 32-bit unsigned integer range. And it is solvable only because each starting node leads into a loop with one of the target nodes, where the length of the loop is a multiple of the length of the sequence of instructions. With this knowledge, one can stop traversing the network once each target node has been reached and calculate the result directly. -### Day 9: Mirage Maintenance +### Day 9: Mirage Maintenance :star: :mag_right: Puzzle: , :white_check_mark: Solver: [`UMirageMaintenance.pas`](solvers/UMirageMaintenance.pas) @@ -134,7 +138,7 @@ The solver calculates how a beam traverses through the grid until it is reflecte Once this was solved for one starting beam in part 1, I just iterated over all possible starting beams to find the maximum for part 2. -### Day 24: Never Tell Me the Odds +### Day 24: Never Tell Me the Odds :star: :mag_right: Puzzle: , :white_check_mark: Solver: [`UNeverTellMeTheOdds.pas`](solvers/UNeverTellMeTheOdds.pas)