No Same Sums

From WPC unofficial wiki
Jump to navigation Jump to search

Rules[edit]

No Same Sums Example.png No Same Sums Example Solution.png

Divide the grid into regions of any sizes and any shapes, so that no number appears more than once within a region. Regions that have at least one common number cannot touch each other, not even diagonally. When you add up all numbers in a region, the resulting sums must be different for all regions.

(Rules and example from WPC 2019 IB)

History of the puzzle[edit]

Appeared on WPC 2019/Round 12, an "innovations" round. The puzzles were written by Silke Berendes.

Appearances in the past WPCs[edit]