Hide and Sneak
(Published on 22. January 2023, 19:03 by lepton)
Every row, column and region contains digits 1-6. Regions are to be determined by the solver. Every regions is a snake, a one cell wide path of orthogonally connected cells that does not branch or contain a 2x2 block of cells.
Cells a chess knight's move apart cannot contain the same digit.
Grey line is a palindrome, which reads the same in both directions.
Each circled cell contains a digit matching the total number of cells from its own region that are visible in its own row and column combined (including itself), with region borders blocking vision.
Solution code: Row 1 followed by row 2 (12 digits)
Comments
on 23. January 2023, 02:23 by Fisherman
Thanks for a very fun puzzle. A bit of thinking to spot the deductions needed to disambiguate. This is not routine at all.
on 22. January 2023, 21:28 by lepton
fix solution code
