I will make a direct translation of the "Improved DaveMcW Algorithm”:
Assumption:
Plane hill city (or parking on elephant) (2P) plus grassland hill forest (1F2P) ==> 1F 4P .
Expansive boosts it to 1F 5P.
You get the first worker in 40/6 = 7 turns.
Plane hill city (or parking on elephant) (2P) plus grassland hill forest (1F2P) ==> 1F 4P.
Imp boosts it to 1F 6P.
You get the first settler in 65/7 = 10 turns.
Overflow speeds up the settler production to: 10, 9, 9.
City-1: produces sttler-2, settler-3, settler-4
city-2: produces worker, settler 5
City-3: produces settler 6
City-1 produces 3 settlers:
Turn 10: settler-1 produced, overflow = 7*10 – 65 = 5
Turn 12: city-2 up (10 + 2 = 12)
Turn 19: settler-2 produced, overflow = 5 + 7*9 – 65 = 3
Turn 21: city-3 up by (10 + 9 + 2 = 21)
Turn 28: settler-3 produced, overflow = 3 + 7*9 – 65 = 1
Turn 29: city 4: up (plain settlement)
City-2 produces a worker and a settler, Worker first.
Turn 12: city-2 up (10 + 2 = 12)
Turn 19: worker-1 done (7 turns), overflow = 6 * 7 – 40 = 2
Turn 23: worker-1 chopping done ===> 13 + 6 = 19P
Turn 26: settler-5 done in 7 turns, overflow = 2 (overflow) + 19 (chopping) + 7 * 7 – 65 = 5
turn 27: city-5 up.
City 3 produces settler 6.
Turn 21: city-3 up by (10 + 9 + 2 = 21)
Turn 24: worker-1 in position, start chopping
Turn 27: worker-1 chopping done ===> 13 + 6 = 19P
Turn 28: settler-6 in 7 turns, overflow = 19 + 7*7 – 65 = 3
Turn 29: city-6 up (plain settlement)
Direct translation of the "Improved DaveMcW Algorithm”: 29 turns for 6 cities. Please check my math.
My feeling is that this time, this is not the optimal algorithm.
Assumption:
Plane hill city (or parking on elephant) (2P) plus grassland hill forest (1F2P) ==> 1F 4P .
Expansive boosts it to 1F 5P.
You get the first worker in 40/6 = 7 turns.
Plane hill city (or parking on elephant) (2P) plus grassland hill forest (1F2P) ==> 1F 4P.
Imp boosts it to 1F 6P.
You get the first settler in 65/7 = 10 turns.
Overflow speeds up the settler production to: 10, 9, 9.
City-1: produces sttler-2, settler-3, settler-4
city-2: produces worker, settler 5
City-3: produces settler 6
City-1 produces 3 settlers:
Turn 10: settler-1 produced, overflow = 7*10 – 65 = 5
Turn 12: city-2 up (10 + 2 = 12)
Turn 19: settler-2 produced, overflow = 5 + 7*9 – 65 = 3
Turn 21: city-3 up by (10 + 9 + 2 = 21)
Turn 28: settler-3 produced, overflow = 3 + 7*9 – 65 = 1
Turn 29: city 4: up (plain settlement)
City-2 produces a worker and a settler, Worker first.
Turn 12: city-2 up (10 + 2 = 12)
Turn 19: worker-1 done (7 turns), overflow = 6 * 7 – 40 = 2
Turn 23: worker-1 chopping done ===> 13 + 6 = 19P
Turn 26: settler-5 done in 7 turns, overflow = 2 (overflow) + 19 (chopping) + 7 * 7 – 65 = 5
turn 27: city-5 up.
City 3 produces settler 6.
Turn 21: city-3 up by (10 + 9 + 2 = 21)
Turn 24: worker-1 in position, start chopping
Turn 27: worker-1 chopping done ===> 13 + 6 = 19P
Turn 28: settler-6 in 7 turns, overflow = 19 + 7*7 – 65 = 3
Turn 29: city-6 up (plain settlement)
Direct translation of the "Improved DaveMcW Algorithm”: 29 turns for 6 cities. Please check my math.
My feeling is that this time, this is not the optimal algorithm.