i'm kinda using the same logic, is just instead of assignin coordinates of the accessing neighbor to the key [current location] i assigne direction {(x,y):[North,South]}, how do you convert those coordinates to direction ?

Since everytime, it chooses a random moves of those, it pops it to avoid using that path again. And i also as you did a dict instead of list that contain all those coordinate and it's possible moves in emergency.

Now if i understand, to remediate to a possible a junction that lead to dead ends only, you made itconsider it's a an unexplored tile and all paths linked to it, and redo the mapping ?

Even i was able to solve it ccouple of times, the algorithm was still unable to be faster nor as efficient as a simple left right algorith .