Question about game's performance

[alexo22]

In one of the recent posts made by Johan it was said that the game's performance depends heavily on the number of provinces the game has.
I'd like to ask what is the approximate computational complexity of the game's process using big o notation? O(n^2) for example where n in the number of provinces.

 

[vaLor-]

I wouldnt take an offhanded comment so close to heart without any data supporting it. I would be willing to bet that 1 tag inhabiting 1 province in australia takes significantly more computational power than 4 empty provinces between central+east africa.

Provinces are mostly fine, but tags should be trimmed.