And whoever implemented Puzzle Quest’s path traversal either enjoys plotting convoluted paths, or judging by the inconsistencies in the path selections, really sucks at graph theory. Um, hello? There’s a subset of algorithms for the SHORTEST PATH problem for a REASON. It’s not like they’re finding the shortest path for randomly changing graph configurations. Every town/node is fixed. They could have hard coded it!!!