This puzzle is a sequel to my previous puzzle
with the same ruleset. The first one is (I think) very hard, but this one should be much easier (I hope). In a sense it is also a kind of tutorial for this ruleset.
A cage is an orthogonally connected region without repeats. A cage of size N is called obvious, if it sums to a number that can be expressed in only one way using N numbers 1-9 without repeats.
Rules of the puzzle:
Standard sudoku rules apply. In addition, all possible 2,3 or 4-cell obvious cages that can be drawn in the finished solution are given as clues (i.e. there is a negative constraint on obvious cages) in the following sense:
every obvious cage of size 2, 3 or 4 that appears in the finished solution is either:
1) drawn in the grid (drawn clue), or
2) represented by its total written by a small number in the upper left corner of one of its cells (total clue).
The cages may intersect. Each total clue represents exactly one obvious cage. Each cage is represented by exactly one clue.
Have fun and thanks (in advance) for any feedback/comments!
Zuletzt geändert am 8. April 2021, 14:46 Uhr