The Whole Nine Yards
(Eingestellt am 22. Februar 2025, 22:06 Uhr von Die Hard)
Fillomino: Divide the grid into regions, each consisting of 1 to 9 cells, such that no two regions of the same size share an edge. Fill each region with its size.
Region Sum: Region borders divide lines into segments of equal sums. Every line has digits in at least two regions, every region includes digits on one and only one line, and lines cannot exit and re-enter a region.
Please leave a comment if you enjoy this puzzle.
Lösungscode: All nine digits in row one.
Kommentare
am 23. Februar 2025, 22:31 Uhr von Christounet
Fun fillo ! Thanks :)
am 23. Februar 2025, 15:51 Uhr von marcmees
Beautiful.thanks for sharing.
am 23. Februar 2025, 15:02 Uhr von Snookerfan
Very nice! I was not entirely sure for a diagonal region sum line piece to be in one region without re-entering, that region had to contain all 4 cells around that line piece or if it could contain only three of those four where the line piece went through a corner of the region. I hope you know what I mean. I did assume all four, because I got stuck and it makes more sense that way. Then it resolved in a really beautiful way. Thank you
Die Hard: I understand, and it is not required to have all 4 cells (ie: a line touching an apex is not considered exiting and re-entering); it can be resolved without that assumption. I'll try and find time to add an example diagram and then edit out this comment when I do. Thanks for taking the time to write this down - its really helpful.
