The authors’ second, more substantive assumption was that a fast path-finding algorithm would remain “rooted” — that is, it would build up a path to the exit node without ever losing track of the ...

The results show that any hypothetical path-finding algorithm that doesn’t blindly guess would have to temporarily lose track of the entrance to have any chance of succeeding.