Either I miss something, or I we both handle the f...

# advent-of-code

[SiebelsTim]

Either I miss something, or I we both handle the following case wrong:

^NNEESWW$.

#########
##.|.|.##
##-###-##
##.|.|.##
##-######
##.######
#########

There is a loop. So the shortest path requiring me to walk through the most doors is 4 I believe. We both get 6 however, as we do not take care of paths that turn into each other. Please correct me if I'm wrong.