Gerrymandering
(Published on 23. February 2025, 18:48 by Grausbert)
Disclaimer
This puzzle was inspired by the YouTube-videoessay of Deckard (link).
Gerrymandering Rules
- Draw edges so that there are a number of areas (=orthogonally connected cells) of equal size.
- Every cell belongs to an area.
- The blue cells must win the most number of areas (no tie with another colour!).
- A colour is said to win an area, if no other colour has more cells in that area.
- An area may not have two colours that share the highest number of cells in that area.
Example for better understanding:
Solution code: The length of continuous cells in row 1 and 3.
In the example: 3131231
Comments
on 30. March 2025, 10:02 by FireTruckFuel
I have gotten used to examples being smaller and simpler than the main puzzle. On this one, they are about the same and it feels like we have been robbed of something, or been given too much hidden knowledge. Definitely a good concept for a puzzle.
on 25. February 2025, 21:40 by Grausbert
Clarified the rules regarding the majority of areas
on 25. February 2025, 17:28 by Grausbert
I got the maths wrong and thus had multiple possible solutions. Now it's fixed. Thanks for the hint @jessica6
on 24. February 2025, 20:02 by Grausbert
Fixed the puzzle having two distinct solutions (thanks to Nylimb)
Fixed the english rule set (thanks to sfushidahardy)
