Shortest Route explanation

Taking what Pulse said about someone finding the shortest route to all of the different towers in BoTW, if you could somehow scale(probably not possible) that into the shortest path/Traveling Salesman Problem, you would solve a problem known as P=NP, or reductions from non-polynomial execution time functions into a polynomial execution time function. If this was proved to be true, then a major breakthrough in math and science, and anything in security would change as well.

P (polynomial time functions) are functions that scale when you use large data sets, and if you try executing them with a computer or a solver, it will take generally the data set size squared (n^2) time to complete

NP (non-polynomial time functions) are functions that scale with a large data set over some base to the size of the data set (2^n, 3^n....)

This is a big problem to solve due to the fact that anything secure uses NP-Complete problems(easy to determine the answer, but no general function).

P=NP means that anything from NP could reduce down to P, that means that any exponential function(NP) could be solved relatively quickly(P).