mathfan2

3 ms·

1. 1.▲
   by mathfan2 9y ago

   > something close to algorithmic probably ends up the least controversial and most comprehensible in the long run One suggestion in this direction is the shortest split line algorithm: http://www.rangevoting.org/GerryExam
2. 2.▲
   by mathfan2 9y ago

   One proposed implementation of your suggestion is the shortest split line algorithm: http://www.rangevoting.org/GerryExamples.html The OP also uses split lines, but they are optimized for maximum partisan effect.
3. 3.▲
   by mathfan2 9y ago

   > the example on the webpage is pretty contrived That's true, but the point of the demonstration is simply that the snaky, salamander-looking shapes are not necessary. There's every reason to believe that you can achieve stunni
4. 4.▲
   by mathfan2 9y ago

   The main takeaway from the article is that sometimes there is a trade-off between nice geometrical shapes and proportional district results. If a machine gave you a crazy-shaped district map because that's the only way to get "low
5. 5.▲
   by mathfan2 9y ago

   > blue is a majority of every 3x3 square Blue is indeed a slight majority of every "3x lattice"-aligned square. But if you take the top left square and shift one down and one right, you'll see that in fact red wins that 3x