day21: example

2023-12-21 08:29:08 +00:00
parent 53930e66ac
commit 5b0f1ab750
4 changed files with 157 additions and 3 deletions
--- a/day21/notes.org
+++ b/day21/notes.org
@@ -0,0 +1,11 @@
+#+title: Notes
+* part 1
+so we aren't looking for minimal distance.
+but all plots which are end to any path of length 'steps left'
+
+so, i have to follow all possible paths to the end?
+or. length of 6 and all even - because i could be doing <- ->
+but i could be doing loop around that would increase path len by odd number
+
+let's just make direct recursive thing.
+create set of all reachable by n,