Place the digits 1-9 in each of the nine rows, columns, and regions. Regions must be determined by the solver. Each region is a 1x9 snake, i.e. an orthogonally connected path with no branching or 2x2 blocks. The middle digit of each region is identical.
Digits in cells marked by a circle count the number of cells 'seen' to the north, south, east, and west within its region. Other regions block the view, and the circled cell counts once in this total. All possible circles are given.
Digits in cages sum to the clue in the top left corner. The cell marked with a grey square must contain an even digit.
A 5x5 example is provided below:
Lösungscode: row 5
am 24. Juni 2022, 03:59 Uhr von Bankey
The "seen" cells in any particular direction have to be in a contiguous block from the circle, or are all cells (of that region) in that direction to be counted even if there are cells of other regions in between? Thanks.
jsmirob: The "seen" cells form a contiguous block. Other regions block the view.
- Thanks for your response.:)
am 22. Juni 2022, 00:06 Uhr von marcmees
beast and beauty ... some great snake logic. thanks.
am 21. Juni 2022, 20:20 Uhr von Tilberg
What a beast ...