From Erfwiki
Jump to: navigation, search

Technically a minimum number of hexes cannot be proven unless the terrain type is known for the "best route" between the two cities. Terrain which is impassible or incurs severe movement penalties could seperate the two cities, causing the Decrypted stacks to take additional turns to traverse hills, or walk around lakes. There is strong evidence (but not proof) to support the theory that the two cities are connected by a road, but the road has a curve through a forest, and isn't a direct path.