SirTurtle
Warlord
- Joined
- Sep 4, 2010
- Messages
- 126
I did some quick calculations to try to figure out the optimal city distance, with the aid of some hex paper. I'm assuming a regular arrangement of cities; in reality this would have to be adjusted for coastlines and other terrain.
Let D = distance between cities. Let S(D,N) = number of tiles shared between N cities for distance D. Define TPC(D) to be the number of tiles per city for distance D, assuming all terrain is claimed and the tiles are distributed evenly among the cities. Clearly TPC(D) = S(D,1) + S(D,2)/2 + S(D,3)/3 + D(D,4)/4.
For example, if D = 4 then for each city there is 1 tile (the city itself) that is not shared. So S(4,1) = 1. There are 18 tiles shared by each city and one of its neighbors, S(4,2) = 18, and 18 shared by each city and two of its neighbors, S(4,3) = 18. There are no tiles shared by 4 cities. So TPC(4)=1+18/2+18/3=16. Similar calculations can be done for other values of D.
In summary:
TPC(3) = 9
TPC(4) = 12 *
TPC(4) = 16
TPC(5) = 25
TPC(6) = 27 *
TPC(6) = 34
TPC(7) = 37
Also for D >= 6 there are gaps between the cities.
So what's the best distance? I'd guess gaps are bad and between 16-25 tiles per city is reasonable, so a city distance of 4-5 is probably best.
Any thoughts?
* There are alternate regular configurations for the even distances. The more compact configurations are generated by "zig-zagging" hexes to travel between cities, the less compact by going straight. There are no gaps in the D=6 compact configuration.
Let D = distance between cities. Let S(D,N) = number of tiles shared between N cities for distance D. Define TPC(D) to be the number of tiles per city for distance D, assuming all terrain is claimed and the tiles are distributed evenly among the cities. Clearly TPC(D) = S(D,1) + S(D,2)/2 + S(D,3)/3 + D(D,4)/4.
For example, if D = 4 then for each city there is 1 tile (the city itself) that is not shared. So S(4,1) = 1. There are 18 tiles shared by each city and one of its neighbors, S(4,2) = 18, and 18 shared by each city and two of its neighbors, S(4,3) = 18. There are no tiles shared by 4 cities. So TPC(4)=1+18/2+18/3=16. Similar calculations can be done for other values of D.
In summary:
TPC(3) = 9
TPC(4) = 12 *
TPC(4) = 16
TPC(5) = 25
TPC(6) = 27 *
TPC(6) = 34
TPC(7) = 37
Also for D >= 6 there are gaps between the cities.
So what's the best distance? I'd guess gaps are bad and between 16-25 tiles per city is reasonable, so a city distance of 4-5 is probably best.
Any thoughts?
* There are alternate regular configurations for the even distances. The more compact configurations are generated by "zig-zagging" hexes to travel between cities, the less compact by going straight. There are no gaps in the D=6 compact configuration.