FlightCommanderSolitude
SOC-13
But, according to this library data page :
In any case, does anybody have any interesting thoughts about pathfinding algorithms? I'm a reasonably proficient coder, but these tweaky compsci problems were never my forte. After noodling around with the problem there appear to be some gotchas that didn't jump out at first glance.
For example, you'd ideally want a list of all routes available to a J(N) vessel from System A to System Z, presumably passing through only those systems that have refueling facilities. With J1 this works out OK; with J2 it poses some interesting challenges. And with J6 the result is just about every possible route on your map, which is probably not that useful.
So, perhaps what would be more useful is a routine to find the shortest path (ie with the fewest jumps) from System A to System Z, optionally passing through Systems B and C, or System D.
Back to the original topic: to model the communications delay, you'd first need to find the nearest xboat links at both the head and tail; I guess the referee would have to decide how much time would pass for a message to get picked up by the xboat network, depending on the importance of the message etc. Then you could use the above algorithm to find the shortest path from head to tail, but you'd use a pruned version of the astrographic data where only xboat links were included. Then you'd multiply the number of jumps in the resulting path by one week or so to find the amount of time the message took to get somewhere.
I haven't looked into the xboat routes but I imagine that xboat route times differ significantly, or at least interestingly, between some equidistant points. Eg, the amount of time it takes for a message to reach Capital from Regina might be much less than for a message to reach Capital from Podunk, even if Regina and Podunk were equidistant hexwise from Capital. The ideal situation here would be to have a map that visually showed a message's "reach" at successive weeks.
Sorry if I'm boring everyone to tears.
Although there appears to be some confusion over where, exactly, Reference is. When I look here it's at Core 0140, which is the value I used. Capital/Sylea is at 2118, not Reference. Uh...confused, please help!By convention, the concentric ring passing through Reference (Core / Core 2118) is labelled the 10,000th ring, and is used as a baseline. Similarly, the ray of latitude extending from the centre of the galaxy through Reference is designated as the first ray.
In any case, does anybody have any interesting thoughts about pathfinding algorithms? I'm a reasonably proficient coder, but these tweaky compsci problems were never my forte. After noodling around with the problem there appear to be some gotchas that didn't jump out at first glance.
For example, you'd ideally want a list of all routes available to a J(N) vessel from System A to System Z, presumably passing through only those systems that have refueling facilities. With J1 this works out OK; with J2 it poses some interesting challenges. And with J6 the result is just about every possible route on your map, which is probably not that useful.
So, perhaps what would be more useful is a routine to find the shortest path (ie with the fewest jumps) from System A to System Z, optionally passing through Systems B and C, or System D.
Back to the original topic: to model the communications delay, you'd first need to find the nearest xboat links at both the head and tail; I guess the referee would have to decide how much time would pass for a message to get picked up by the xboat network, depending on the importance of the message etc. Then you could use the above algorithm to find the shortest path from head to tail, but you'd use a pruned version of the astrographic data where only xboat links were included. Then you'd multiply the number of jumps in the resulting path by one week or so to find the amount of time the message took to get somewhere.
I haven't looked into the xboat routes but I imagine that xboat route times differ significantly, or at least interestingly, between some equidistant points. Eg, the amount of time it takes for a message to reach Capital from Regina might be much less than for a message to reach Capital from Podunk, even if Regina and Podunk were equidistant hexwise from Capital. The ideal situation here would be to have a map that visually showed a message's "reach" at successive weeks.
Sorry if I'm boring everyone to tears.