Single Disambiguator 1 (Anti-Knight + Renban Lines)

(Eingestellt am 25. November 2022, 15:20 Uhr von Jeet Sampat)

Knight Ban

The goal of this series is to experiment with certain rule-sets to divide the digits 1-9 into certain groups, and being able to assign each cell in the grid with possible candidates from each group. Then, a single (usually little killer) clue will disambiguate the whole grid! I hope you enjoy the puzzle.

Rules:

Normal Sudoku rules apply.
Cells separated by a Chess knight's move must contain different digits.
Purple lines contain a set of non-repeating consecutive digits.
The clue outside the grid gives the sum of digits on the indicated diagonal. Digits may repeat on such diagonals if allowed by the other rules.

Try it on the CTC app or on f-puzzles.

Puzzle:

Lösungscode: Row 8 (left to right) and column 8 (top to bottom); 18 digits, no spaces.

Gelöst von AvonD, jguer, MB_Cyclist, Iluvsodah, ellipsisfinisher, nogirosta, SKORP17, dtoto, Elliott810, apendleton, by81996672, madhupt, abed hawila, ficko, ordnanceordinance, galgamer, albertol, Bjd, Askloomok, koba1917, KNT, askel083, Megalobrainiac, Corey115, agueybana, Jdt112, acdlite, Tom Bombadil, KyleBaran, FlowJo, 5423addy, Illuminated, 99jau99, Julianl, Azumagao, Gregory
Komplette Liste

Kommentare

am 30. November 2022, 11:04 Uhr von Jeet Sampat
Glad you enjoyed the puzzle. @KyleBaran @koba1917!

am 30. November 2022, 10:01 Uhr von KyleBaran
Got the break in easily enough, spent most of the time finding knight placements.
Disambiguating a certain number in box 4 was a treat

am 27. November 2022, 02:36 Uhr von koba1917
Wow, super awesome puzzle! Agree, the break in is tough

am 26. November 2022, 19:52 Uhr von albertol
Really Liked this puzzle, Breaking was tough.
Thanks!

am 26. November 2022, 19:47 Uhr von Jeet Sampat
Thanks, @albertol! Glad you made it through the puzzle and enjoyed it :)

am 26. November 2022, 18:21 Uhr von albertol
Really Liked this puzzle, Breaking was tough.
Thanks!

 Schwierigkeit: Bewertung: 96 % Gelöst: 36 mal Beobachtet: 1 mal ID: 000C4M

Lösungscode: