Advent of Code Week 3 - you're lost in a maze of twisty mazes, all alike (awful.systems)

submitted 2 days ago* (last edited 1 day ago) by gerikson@awful.systems to c/notawfultech@awful.systems

8 comments fedilink hide all child comments

Problem difficulty so far (up to day 16)

Day 15 - Warehouse Woes: 30m00s
Day 12 - Garden Groups: 17m42s
Day 14 - Restroom Redoubt: 15m48s
Day 09 - Disk Fragmenter: 14m05s
Day 16 - Reindeer Maze: 13m47s
Day 13 - Claw Contraption: 11m04s
Day 06 - Guard Gallivant: 08m53s
Day 08 - Resonant Collinearity: 07m12s
Day 11 - Plutonian Pebbles: 06m24s
Day 04 - Ceres Search: 05m41s
Day 02 - Red Nosed Reports: 04m42s
Day 10 - Hoof It: 04m14s
Day 07 - Bridge Repair: 03m47s
Day 05 - Print Queue: 03m43s
Day 03 - Mull It Over: 03m22s
Day 01 - Historian Hysteria: 02m31s

you are viewing a single comment's thread
view the rest of the comments

[-] gerikson@awful.systems 2 points 2 hours ago

day 18

bit of a breather episode

As long as you ensure A* / Dijkstra's (is there a functional difference if the edge weights are constant?) you'll get the shortest path. Part 2 was just simulation for me, if I started in the state of part 1 it took a minute to run through the rest of the bytes.

[-] swlabr@awful.systems 1 points 2 hours ago

yes

What is this, day 16?

this post was submitted on 16 Dec 2024

9 points (100.0% liked)

NotAwfulTech

385 readers

3 users here now

a community for posting cool tech news you don’t want to sneer at

non-awfulness of tech is not required or else we wouldn’t have any posts

founded 1 year ago

MODERATORS

self@awful.systems