Originally posted by funxus
I think that was what la fayette was trying to explain, in french though
In the civ2 democracy game we had a picture in the beginning showing the optimal paths, but I couldn't find it.
I figured that's what he was doing, which is what made me ask, but I'm thinking of a more complete description of the algorithm. This is particularly noteworthy when considering that the bonus is determined by the "return" route which we couldn't simulate from a foreign city using a goto even if we wanted to ...
I assume a straight line is used if available, but...
If not on a straight line, does it go diagonal first then horizontal/vertical? Is it Horizontal/vertical first, then diagonal? or neither?
Does it perhaps try a certain direction first (e.g., North) to see if that gets it closer, then try the next direction (NE or NW), etc.?
Does it ever go horizontal and vertical, avoiding the diagonal?
How does it react when encountering a blockage (e.g., ocean) to what would normally be the optimal path?
If there is an ocean blockage, does it plan ahead to avoid it, or does it go until it runs into the blockage, then react?
Does a foreign (3rd party) city on what would be the optimal path negate the bonus, or does it mean the optimal path must go around it as if it were ocean (the way your explorer might when told to "GoTo" the city?
I think it's been established that terrain type does not affect the route (as long as it's land), right?