Mercurial > repos > other > adventofcode2023
annotate day23.txt @ 38:8e92cb172e6b
Output final distance
Also minor code cleanup
author | IBBoard <dev@ibboard.co.uk> |
---|---|
date | Fri, 20 Sep 2024 20:30:11 +0100 |
parents | a1b748f2c416 |
children |
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). |