Mercurial > repos > other > adventofcode2023

annotate day23.txt @ 33:676461cc3a70

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Day 23 - track segments, not each space This allows us to explore the branches once then do quicker calculations for valid route lengths. But still requires exploring 1,262,816 routes to find the longest!
author IBBoard <dev@ibboard.co.uk>
date Thu, 04 Jan 2024 14:52:24 +0000
parents a1b748f2c416
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
32
a1b748f2c416 Implement day 23 "longest route finding"
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
1 --- Day 23: A Long Walk ---
a1b748f2c416 Implement day 23 "longest route finding"
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
2
a1b748f2c416 Implement day 23 "longest route finding"
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
3 You have a map made of blocked spaces (#), open spaces (.) and slopes (^, >, v, and <). You can't go back up slopes.
a1b748f2c416 Implement day 23 "longest route finding"
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
4
a1b748f2c416 Implement day 23 "longest route finding"
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
5 What is the LONGEST route from the start (open space in the top row) to the end (open space in the bottom row).