Minimal Sum (Introduction)
(Published on 6. January 2024, 13:14 by Tiffanatisk)
I've been exploring the minimal sum constraint, and this is an introductory puzzle. If someone had done this before, please tell me in the comments, and I'll refer to the original. I'll possibly go on to create a series of puzzles combining the minimal sum constraint with other familiar constraints, or variants of this constraint.
Normal sudoku rules apply. Clues outside the grid indicate the smallest possible sum of X adjacent digits in that direction, where X is the first digit in that direction. For example, a row containing the digits 471938562 would have the clue 20 to the left (7+1+9+3=20), and 8 to the right (7+1=6+2=8).
CtC Link: here.
Below is an example illustrating how the rules apply in a 6×6 sudoku. You can try this yourself on CtC.
Solution code: Row 4 (Left to right), followed by Column 4 (Top to bottom)
Comments
on 9. January 2024, 08:31 by Tiffanatisk
A simplified version is made. Here's the link:
https://logic-masters.de/Raetselportal/Raetsel/zeigen.php?id=000GI6
on 8. January 2024, 17:44 by marcmees
The concept has potential butfFor a new constraint, this was a rough start. An easier introduction would have attracted definitely more solves.
on 7. January 2024, 11:18 by Briks
Hard one. Just beginning to comprehend this ruleset. Had to try a lot. But I'm looking forward to more of this.
