Reindeer Maze [Day 16 - Advent of Code 2024 - Python] скачать в хорошем качестве

Reindeer Maze [Day 16 - Advent of Code 2024 - Python]

I'm given a maze with a start and end with many ways to get between them. There's a cost to step forward and a much larger cost to turn. I'm asked for part 1 to find the least cost to get from start to end. In part 2, I need to find a count of the spaces included in any of the paths that have the lowest cost. I'll use Dijkstra's algorithm to solve both, adding additional state for the second part. Dikstra's algorithm: https://en.wikipedia.org/wiki/Dijkstr... 2024 AOC repo: https://gitlab.com/0xdf/aoc2024/ 2024 AOC Intro video:    • Introduction [Advent of Code 2024]   VSCode Debug video:    • Configuring VSCode to Debug Python [AOC202...   ☕ Buy Me A Coffee: https://www.buymeacoffee.com/0xdf [00:00] Part1 introduction [01:20] Setup / data overview [02:08] Parsing input, finding start [03:02] Setting up Dijkstra's [04:45] Looping over states, checking for end [05:42] Stepping forward [06:53] Turning [08:08] Solving part 1 [08:47] Testing speed improvement [10:44] Part 2 challenge [11:28] Updating break condition [13:52] Tracking path in state [15:43] Solving part 2 [16:22] Review code [18:11] Checking tuple instead of list for path #adventofcode #python