Mercurial > repos > other > adventofcode2023

diff day23.txt @ 32:a1b748f2c416

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Implement day 23 "longest route finding" Allows for "downhill only" and "can climb" approaches. But climbing still brute-forces the map and takes too long on the final input.
author IBBoard <dev@ibboard.co.uk>
date Thu, 04 Jan 2024 11:18:56 +0000
parents
children
line wrap: on
line diff
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/day23.txt	Thu Jan 04 11:18:56 2024 +0000
@@ -0,0 +1,5 @@
+--- Day 23: A Long Walk ---
+
+You have a map made of blocked spaces (#), open spaces (.) and slopes (^, >, v, and <). You can't go back up slopes.
+
+What is the LONGEST route from the start (open space in the top row) to the end (open space in the bottom row).
\ No newline at end of file