This is the mail archive of the xconq7@sources.redhat.com mailing list for the Xconq project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Another path-finding bug?


I have found that in russian-rev.g, a train fails to find the path if it
is "blocked" by a town, city, or fort (which it can move through).  It
seems to be able to figure out when it can or cannot fit in a cell along
with all its other occupants, but it cannot figure out if it can pass a
blocked cell by occupying one of the units in that cell.

I also noticed that the algorithm fails to consider attrition when
choosing a path (e.g. a fleet in shallows, cavalry in desert).  It seems
to me that the algorithm should avoid taking paths that cause attrition
if at all possible.


These bugs probably are not related to the cannot do anything in water"
bug I found earlier, but they involve the same pathfinding code.

-- 
Lincoln Peters <sampln@sbcglobal.net>


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]