Series /
Advent of Code 2023
Every Advent of Code 2023 puzzle I solved in Python, one post a day, with the code and how I thought about it.
-
Day 0 1 min read
Advent of Code 2023 Advent of Code 2023 is here and I am planning to push code daily this time as the problems unfold! -
Day 1 2 min read
Trebuchet?! Solving Advent of Code 2023 Day 1 in Python: the first and last digit of each line, then spelled out digits and overlaps like eightwothree. -
Day 2 3 min read
Cube Conundrum Solving Advent of Code 2023 Day 2 in Python: parsing cube game records to find possible games, then computing the power of the minimum cube sets for Part 2. -
Day 3 4 min read
Gear Ratios Solving Advent of Code 2023 Day 3 in Python: finding part numbers adjacent to symbols in an engine schematic grid, then summing gear ratios for Part 2. -
Day 4 8 min read
Scratchcards Solving Advent of Code 2023 Day 4 in Python: scoring scratchcards with 2^(n-1) points, then tracking won copies with a card count repository for Part 2. -
Day 5 13 min read
If You Give A Seed A Fertilizer Solving Advent of Code 2023 Day 5 in Python: mapping seeds on demand, then range intersections that beat a 34 minute brute force for seed ranges. -
Day 6 8 min read
Wait For It A Python walkthrough of Advent of Code 2023 Day 6: counting the ways to beat each boat race record by charge time, then solving one big race for Part 2. -
Day 7 9 min read
Camel Cards Solving Advent of Code 2023 Day 7 in Python: ranking Camel Cards hands by type and card order with a custom sort key, then treating J as a joker in Part 2. -
Day 8 9 min read
Haunted Wasteland A Python walkthrough of Advent of Code 2023 Day 8: following left/right instructions through a node network, then using cycle lengths and LCM for Part 2. -
Day 9 8 min read
Mirage Maintenance A Python walkthrough of Advent of Code 2023 Day 9: extrapolating the next and previous values of sequences by repeatedly taking differences. -
Day 10 13 min read
Pipe Maze Solving Advent of Code 2023 Day 10 in Python, finding the pipe loop with a greedy DFS and counting enclosed tiles using the Shoelace formula and Pick's theorem. -
Day 11 10 min read
Cosmic Expansion Solving AoC 2023 Day 11 in Python, from an overengineered BFS and A* approach to the simple Manhattan distance trick that handles a million-fold expansion. -
Day 12 11 min read
Hot Springs Solving AoC 2023 Day 12 in Python, from brute-force spring arrangement combinations to a cached recursive approach with early pruning for the unfolded records. -
Day 13 8 min read
Point of Incidence Solving AoC 2023 Day 13 in Python by finding mirror lines in ash and rock patterns with a palindrome-style fan out, then handling smudges in Part Two. -
Day 14 9 min read
Parabolic Reflector Dish Solving AoC 2023 Day 14 in Python by tilting rocks on a platform, then detecting the repeating cycle to skip a billion spin cycles in Part Two. -
Day 15 12 min read
Lens Library Solving AoC 2023 Day 15 in Python by implementing the HASH algorithm and then the HASHMAP lens box procedure with Box and Lens classes. -
Day 16 10 min read
The Floor Will Be Lava Solving Advent of Code 2023 Day 16 in Python: simulating a light beam through mirrors and splitters with BFS, then trying every edge entry point for Part 2. -
Day 17 10 min read
Clumsy Crucible Solving Advent of Code 2023 Day 17 in Python: a memoized DFS to minimize crucible heat loss, then Dijkstra with a priority queue for the Ultra Crucible. -
Day 18 9 min read
Lavaduct Lagoon Solving Advent of Code 2023 Day 18 in Python with the Shoelace formula and Pick's theorem, then scaling up to huge hex-encoded dig plans in Part 2. -
Day 19 11 min read
Aplenty Solving Advent of Code 2023 Day 19 in Python: a rule engine that sends machine parts through workflows, then splitting rating ranges to count combinations. -
Day 20 16 min read
Pulse Propagation Solving Advent of Code 2023 Day 20 in Python by simulating flip-flop and conjunction modules with classes, then finding the rx button press count with LCM.
Comments
No comments yet. Start the conversation.
Comments couldn't load right now.