Depending on your library of valid transition, it could be really easy to find a path. That's the issue: there are libraries of paths where finding a path is re

Depending on your library of valid transition, it could be really easy to find a path. That's the issue: there are libraries of paths where finding a path is really hard, but libraries where finding a path is easy. Say in another way, we know only the worst case complexity, not the complexity of a test case taken randomly. Some latices-based cryptosystems have such properties: there are theorems showing that if there is an algorithm good at solving random cases, than you can derive from it an algorithm good at solving any cases, including the worst ones. So for those problems, the worst case complexity is the same than the "average/random case" complexity.