πŸ— - 2025 DAY 10 SOLUTIONS - πŸ—

https://programming.dev/post/42126480

πŸ— - 2025 DAY 10 SOLUTIONS - πŸ— - programming.dev

# Day 10: Factory ## Megathread guidelines - Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever) - You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ [https://topaz.github.io/paste/] if you prefer sending it through a URL ## FAQ - What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268 [https://programming.dev/post/6637268] - Where do I participate?: https://adventofcode.com/ [https://adventofcode.com/] - Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465 [https://programming.dev/post/6631465]

Quiet here, isn’t it?

Here’s part1 to be going on with.

spoiler

Path-finding takes waaaay too long for part 2. Off to do some linear algebra now :-(

# AOC 2025 Day 09 - Wiring maze D ← "[.##.] (3) (1,3) (2) (2,3) (0,2) (0,1) {3,5,4,7}\n[...#.] (0,2,3,4) (2,3) (0,4) (0,1,2) (1,2,3,4) {7,5,12,7,2}\n[.###.#] (0,1,2,3,4) (0,3,4) (0,1,2,4,5) (1,2) {10,11,11,5,10,5}" # D ← &fras"randomAOC/AOC2025day10.txt" Digits ← βŠœβ‹•βŠΈβˆŠ+@0⇑10 Parse ← ⊜(β–‘βŠœβ–‘βŠΈβ‰ @\s)βŠΈβ‰ @\n Part₁ ← ( ≑◇( =@#β†˜β‚β†˜β‚‹β‚Β°β–‘Β°βŠ‚β†˜Β―1 # target βŠ™β¬š0≑◇(°⊚Digits) # presses ⧻⊒path(β‰‘βŒžβ‰ |=0/+) # find shortest path ) /+-1 ) Part₁ Parse D
Everyone has PTSD from yesterday.
I’m getting PTSD from today now.