Advent-of-Code-2023/day21/notes.org

Notes

• part 1
• oh, the part 2.

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,

oh, the part 2.

i suppose this 'infinite' garden could be managed with my 'neighbors' work with 'out of field' fairly easy but what about sizes of the maps? are we releasing maps of previous iterations?

maybe if i directly pass references to prev and current, and manually set 'prev' to target new it will be collected?

and then elements after these steps <em>26501365</em> would fit into memory?