| Requiring geometric contiguity allows almost-unchanged gerrymandering through the backdoor. Here's the Stonewall algorithm to gerrymandering with contiguous Define-Combine: 1. Start by gerrymandering a map with N contiguous districts the usual way. 2. Pick one of the districts to be your "mortar", the others are your "bricks". 3. Shrink all bricks minimally to open gaps between them without changing the population or election outcome. 4. Fill in the gaps with your mortar, so that all bricks are completely enveloped. 6. Split all bricks and the mortar in half, ensuring that one of the mortar halves does not touch any bricks. This gives you your final map of 2N contiguous districts for the second mover to combine. Then the mortar half that doesn't touch any bricks can only be combined with the other mortar half. And since all bricks are completely surrounded by mortar (which they can no longer be combined with) the second mover can only combine a brick half with the other half of the same brick. This leads to a map with the same outcome as the original gerrymandered map. Of course it would be blindingly obvious if anyone actually attempted to do that, but there might be subtler ways to use contiguity to create a forced-choice situation. |
Of course, the chromatic polynomial is #P-complete, so this may pose some difficulty.