Divide the grid into regions of orthogonally connected cells. Two regions of the same size may not share an edge, and each cell contains a number equal to the size of the region. Three edges are already given.
A diamond between two vertically adjacent cells indicates that the numbers in the cells have a difference equal to the topmost number in the column.
A diamond between two horizontally adjacent cells indicates that the numbers in the cells have a difference equal to the leftmost number in the row.
All possible diamonds are given, i.e., if no diamond is present, then the difference between two orthogonally adjacent cells must not equal the number in the topmost/leftmost cell.
Solve the puzzle in Penpa here (Use either edgesub tool or numbers/digits, or both, for answer check.)
Solution code: For each column, give the longest uninterrupted distance between two region edges (possibly including the edge of the puzzle). (10 digits total)
on 30. August 2023, 04:27 by wisty
Really neat ruleset and magical execution :)
___
Many thanks indeed, wisteria!
on 22. August 2023, 21:36 by ascension
Encore!
- you are likely to get your wish, thank you for the encouragement!
on 22. August 2023, 16:55 by samuel1997
What a innovative combination of the ruleset! The negative constrait is superbly powerful! Brilliant!
--
Thank you for solving and commenting, I'm very flattered!
on 22. August 2023, 01:37 by glum_hippo
Thank you, nordloc and marc, for your comments.
on 21. August 2023, 20:20 by marcmees
very nice with diamonds where needed to show the way through a beautiful labyrinth. Thanks
on 21. August 2023, 14:19 by nordloc
I love this. It felt like a very nice smooth flow of logic from beginning to end.