Quote:
Loren said:
Quote:
vfb said:
Well, here's a really simple algorithm that would be better than the current one IMO.
Maintain a CurrentSearch list of sites being searched in current month.
Code:
* Loop through owned sites to find next province to search:
- Capitol? Discard.
- 4 sites known? Discard.
- In CurrentSearch? Discard.
- Rank =
100 * (4 - (current search path level searched in province)
+ 10 * (4 - (# of known sites))
+ (total of other paths already searched in province)
- Rank < CurrentRank? Discard.
- CurrentRank = Rank, add to CurrentSearch list
Needs some modification to handle Tiamat, but so does the current search.
|
I don't see the reason for the number of other paths searched term. I think the number of sites found is the important term.
...
|
When all provinces to be searched have the same number of found sites, and have been searched at the same level in the path being searched, then you want to search the provinces that have been 'cleared' of other paths first. The provinces that have not been 'cleared' are more likely to contain sites of those other paths.
The algorithm sorts first by unsearched provinces by the path being searched. Only if two or more provinces are equal in that respect does it consider the number of known sites. And only if that count is equal does it consider the searched paths total.
It's possible it should weight (a province with zero found sites that has been searched at W1) higher than (a province with three found sites that has not been W searched.)
It doesn't do that, but I wanted to come up with something quick and practical to implement. I'm not interested in theory so much.