Caravans - what is the logic for allowed routes?

[Anaris]

The calculations bit has to do with the Dykstra algorithm used in the travel code, to find the shortest route. It uses a lot of resources to test all the variable paths for time AND distance; these generally need to be rerun each time, because so many things can affect the routes' times even from turn to turn.

And it doesn't help that each step along the way needs to hit the database, to find out which regions are adjacent.

[^ban^]

stuff

As a networking student, I find this post adorable. The specific algorithms used by the various routing protocols are largely useless to us. Terms such as link-state have no real application in BM terminology unless we take the time to track region changes.

Sorry. I could not help it. It never dawned on me that computing the patch between regions in BattleMaster would be a lot like computing paths between routers in a network. Sounds like BM has it's own link-state routing protocol. Who would have guessed!

Both problems fall under the subset of graphing solutions. There are many, many other places where such problems arise. If you're a networking student of some sort and are interested in these sorts of things, you should start reading about graph theory.