this is so fun . first time in advent of code, i have finally hit the inevitable “it will never complete before i go to bed” type of performance 
https://github.com/jarlah/advent_of_code/blob/master/lib/2024/day_6/Part2.ex#L29
anyone with smarter ways to find “deadlocks” by checking if traversal count is larger than the total length of map ?? 
for ALL single characters …
anyway .. its actually taking SECONDS to check each single character 
thats so … fun … literally no improvements done on it whatsoever though 
