Загрузка...

Day 23: Long Walk [AOC2023 Python]

For Advent of Code 2023 Day 23, I get a grid with paths through a forest. I'm asked to find the longest path possible. I'll reduce the problem by getting a list of junction points where I have multiple options, and then use that to brute force all paths.

Code 2023 AOC: https://gitlab.com/0xdf/aoc2023
Challenge Link: https://adventofcode.com/2023/day/23

☕ Buy Me A Coffee: https://www.buymeacoffee.com/0xdf

[00:00] Part 1 description
[01:15] Input analayis
[02:41] Getting start and end
[03:40] Find junctions
[06:14] Map distances between junctions
[11:11] Fix bug in junctions
[12:08] Brute force all paths
[15:35] Solve part 1
[17:53] Part 2 description
[18:02] Solve part 2 by modifying part 1
[19:15] Refactoring solve into function to solve both
[22:17] Final solve with time / Summary

#adventofcode #python

Видео Day 23: Long Walk [AOC2023 Python] канала 0xdf
Яндекс.Метрика
Все заметки Новая заметка Страницу в заметки
Страницу в закладки Мои закладки
На информационно-развлекательном портале SALDA.WS применяются cookie-файлы. Нажимая кнопку Принять, вы подтверждаете свое согласие на их использование.
О CookiesНапомнить позжеПринять