Diamond Valley
(Published on 11. August 2026, 15:40 by Azvaril)
Hello. Here is a puzzle with a negative constraint for you.
Have a good time solving!
Solve on SudokuPad
Normal Sudoku: Every row, column, and 3×3 box must contain the digits 1 to 9 exactly once.
Green Diamonds: Digits separated by a green diamond must have a difference of at least 5.
All possible green diamonds are given.
Solution code: Column 9, 9 digits from top to bottom.
Comments
on 15. August 2026, 22:45 by briansometimes
Don't understand how I missed the negative restraint reading the description again after finishing, but anyway, without negative constraint, this becomes a very slow grinding 4 star puzzle after quite an easy start.
on 14. August 2026, 05:44 by KyleBaran
Had a strange, but very pleasant flow
on 12. August 2026, 20:40 by firespire
I liked that it was presented differently from the line versions.
on 12. August 2026, 03:17 by BigHead
Excellent puzzle! Thank you.
on 12. August 2026, 02:57 by SanFranSam
Solved it the first time by bifurcasting. Went back and solved it for reals.
BTW, could the puzzle have be done with lines rather than diamonds. (˘・_・˘).oO
on 12. August 2026, 00:20 by macintux
I love negative constraints, they generally keep the puzzle interesting up to the end, and this one definitely fits the pattern. Very nice.
on 11. August 2026, 20:23 by hardline35
Very enjoyable puzzle, thank you!
on 11. August 2026, 20:23 by hardline35
Very enjoyable puzzle, thank you!
on 11. August 2026, 16:42 by HeyItsErin
Very fun puzzle with an excellent use of the negative constraint!
