Complete.Org: Mailing Lists: Archives: freeciv-dev: October 2002:
[Freeciv-Dev] Re: Path-finding in the presence of danger
Home

[Freeciv-Dev] Re: Path-finding in the presence of danger

[Top] [All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index] [Thread Index]
To: Gregory Berkolaiko <Gregory.Berkolaiko@xxxxxxxxxxxx>
Cc: freeciv-dev@xxxxxxxxxxx
Subject: [Freeciv-Dev] Re: Path-finding in the presence of danger
From: rf13@xxxxxxxxxxxxxxxxx
Date: Mon, 7 Oct 2002 03:39:45 -0700

On Fri, Oct 04, 2002 at 08:00:09PM +0100, Gregory Berkolaiko wrote:
> Raimar,
> 
> You answered this question already but I cannot find it in the archives.  
> So please explain again.  In path_finding_macro in expand() you set up two 
> maps.  What are they for?

> It seems one is to find positions reachable within one turn and the second 
> is to find the path leading to them but also taking into account the 
> extra_cost and COP?

Fully correct.

It may need redesign because of the introduction of get_TB.

> BTW, I have serious reason to believe that it will be _very_ difficult to 
> find the best micro-path using extra_cost and COP.  I am pretty sure your 
> algorithm will also fail to do it in one way or other, but I will need to 
> understand it more, so please help me here.

Why is it difficult? You only have to provide the _exact_ last macro
path destination state as the start of micro path searching. This is
the reason for the extra start_* parameter of plain_get_map.

> It is still possible to take into account the extra cost of the 
> non-dangerous tiles.  This does make certain sense: you are not going to 
> stop at the dangerous tiles, so it does not matter whether they are nice 
> or not.

I don't understand you.

        Raimar

-- 
 email: rf13@xxxxxxxxxxxxxxxxx


[Prev in Thread] Current Thread [Next in Thread]