In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

The strategy was designed by a Michigan-based computer scientist. He plotted Waldo's (pictured) locations and then used an algorithm to find the shortest path between these points.

Doctoral student creates algorithm to locate Where’s Wally in shortest time possible HAVE you ever spent hours aimlessly searching for Where’s Wally? If so, a researcher has found a solution ...