Complete.Org: Mailing Lists: Archives: freeciv-ai: November 2004:
[freeciv-ai] Re: (PR#10203) Greedy CM algorithm

[freeciv-ai] Re: (PR#10203) Greedy CM algorithm

[Top] [All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index] [Thread Index]
To: per@xxxxxxxxxxx
Subject: [freeciv-ai] Re: (PR#10203) Greedy CM algorithm
From: "Gregory Berkolaiko" <Gregory.Berkolaiko@xxxxxxxxxxxxx>
Date: Fri, 19 Nov 2004 09:50:03 -0800
Reply-to: rt@xxxxxxxxxxx

<URL: >

On Fri, 19 Nov 2004, ue80@xxxxxxxxxxxxxxxxxxxxx wrote:
> I have not looked into the code so i don't know if my following
> suggestion is allready implemented.
> What is about first group all tiles into the possible gains for the
> city.
> 2/2/1  4 times
> 2/1/2  2 times
> 1/0/0  4 times
> And doing the algorithm afterwards. 
> For a size 5 city it's possible to remove the 4 times 1/0/0 because
> there is no optimal solution with it  because all other tiles are
> better.

This is exactly what the code does now (with the B&B patch).

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