I constructed this as practice for the recent GP round, since it was a new puzzle type.
Place a number from 1 to 8 into every cell of the grid so that each number appears exactly once in each row and column.
A number N in an uncircled cell "attacks" those cells at an orthogonal distance of exactly N from itself. A number K in a circled cell does not attack, but instead must be attacked at least K times.
Lösungscode: Row 2, Row 7
am 1. August 2021, 17:48 Uhr von Vebby
Loved it! Thanks Feadoor! :)
am 9. Mai 2021, 14:09 Uhr von DiMono
Challenging puzzle! I made it in penpa with answer check: https://git.io/J3FA5