Re: [glob2-devel] Pheramonal-Directional Algorithm

[Andrew Sayers]

On Tue, Nov 08, 2005 at 03:42:58PM -0500, Andrii Zvorygin wrote:
>    what i was thinking was that when the first glob using A* finds the
>    resources (as the trails will be from a certain inn say to the wheat
>    resource) we can along side the type destination borrow a bit to show if
>    any water squares are crossed in the proccess (this should be pretty
>    simple to implement, simply when it has found the optimal path it runs the
>    squares through to check if any are water squares, if yes then we set the
>    swim bit, if not then we don't)
> 
>    btw i forgot to mention, the type will point to 2 bytes that could store
>    the end location and swim bit, it wont store the locations to a precise
>    point, it can say divide the grid by 4, so instead of 512x512 it will be
>    128x128, and not only will it take up less room. also if a glob gets lost
>    it will check the entire square for say wheat instead of just the original
>    wheat source.

If the path crosses water, what then?  Surely you need a different path
for the globs that can't swim?

        - Andrew