Tower Defence is a puzzle type that was invented by Roger Kohler for Round 3 of the 2020 edition of the WPF Puzzle Grand Prix. I created this puzzle as practice for the round. As it turned out, none of the ideas in this puzzle were necessary to solve the contest puzzles, but I'm pleased with it as a puzzle in its own right.
Rules
Place a number from 1 to 6 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.
Difficulty: 5/10
Comments
Post a Comment