Logic Masters Deutschland e.V.

Knight Sweeper/ Springer Kehrmaschine

(Published on 30. April 2021, 16:13 by Ryx)



Normal Sudoku rules apply

Litte Killer - numbers along the indicated diagonal must sum to the number beside the arrow. Digits may repeat along the diagonal.

All non-circled cells obey the anti-knight rule.

For each number N from 2 to 7, the following is true: There are N circled cells that contain the number N. All circled cells that contain the number N must be connected through a chain of chess-knight moves. The chain may branch.

There are also 8 circled 8:s. Each circled 8 sees exactly one other circled 8 by a chess-knight move.

Click the Link to play on f-puzzles

See example below



This puzzle was inspired by Phistomefel's "Chaos Construction: Minesweeper" puzzle (https://logic-masters.de/Raetselportal/Raetsel/zeigen.php?id=0005TN), that I recently saw solved by Simon on Cracking the Cryptic. Somehow I got it in my head "Knight sweeper", when hearing "Minesweeper" or I think at some point Simon said "Nine Sweeper".

And shout out to Goran H for improved rule description!

Solution code: Digits from row 5 then column 5


Solved by Göran H, SudokuExplorer, Shmartus, Annunakki, Puffke, jchan18, johnnymanc, raum
Full list

Comments

on 11. August 2021, 00:15 by uvo_mod
Label Online-Solving-Tool ergänzt, außerdem Variantenkombination statt Rätselvariante.

Last changed on 30. April 2021, 21:15

on 30. April 2021, 20:13 by Annunakki
Really good puzzle. Well done!

Ryx: Thank you!

Last changed on 30. April 2021, 21:14

on 30. April 2021, 18:49 by SudokuExplorer
Fun knight's tour variant! Thanks, I really enjoyed it :-)

Ryx: You are very welcome. It was a real challenge to set, mainly because I approached it from the wrong end of the logic. Glad you enjoyed it!

on 30. April 2021, 17:01 by Göran H
This is a very good puzzle! Even though you were inspired by Phistomefel's puzzle, this is very much your own unique creation in a very different style. Very well done and very creative!

Difficulty:2
Rating:N/A
Solved:8 times
Observed:9 times
ID:00064E

Variant combination Computer assistance Online solving tool

Enter solution

Solution code:

Login