I would suggest formulating it as a quadratic unconstrained binary optimization problem and using a D-Wave quantum annealer to solve it! You can get some free time here https://cloud.dwavesys.com.
From: Friam <[email protected]> on behalf of cody dooderson <[email protected]> Reply-To: The Friday Morning Applied Complexity Coffee Group <[email protected]> Date: Friday, November 2, 2018 at 10:23 AM To: The Friday Morning Applied Complexity Coffee Group <[email protected]> Subject: [FRIAM] gerrymandering algorithm question The other day a puzzle about gerrymandering was shown to me. It is on the web at https://fivethirtyeight.com/features/rig-the-election-with-math/ . The 5x5 puzzle is doable by hand but the 14x10 seems too complex, and ripe for some computer assistance. What kind of algorithm would people use for it? Is there an optimal way to gerrymander the entire country? In order to qualify this question as complex or philosophical enough for FRIAM, maybe i should speculate about how I think that ranked choice voting would be better in terms of gerrymandering than what we currently use. My gut instinct is that ranked-choice would be less predictable and could possibly deter the gerrymanderers. Cody Smith
============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ by Dr. Strangelove
