Logic Masters Deutschland e.V.

Sudoku Variants Series (368) - N-Sums - Smallest

(Published on 27. April 2022, 00:00 by Richard)

For this Sudoku Variants Project I have planned to publish a different Sudoku variant every week. I will see how long it takes before I am running out of ideas.

N-Sums - Smallest
Apply classic sudoku rules.
Clues outside the grid indicate the sum of the first N digits from that side, where N is the smallest of the first two digits from that side.

Solve online in Penpa+ (thx Henrypijames!) or F-Puzzles or CtC-app (thx Steven R!)

Solution code: Column 4, followed by column 5.

Last changed on on 30. April 2022, 06:26

Solved by SKORP17, Steven R, Greg, Piatato, Nick Smirnov, rcg, henrypijames, deltameth, Statistica, Playmaker6174, marcmees, azalozni, adam001, ashwin, Isa, efnenu, 111chrisi, geronimo92, Senior, minus2ev, ... EKBM, Uhu, Frankenfruity, TomBradyLambeth, Angelo, h5663454, zorant, Nothere, AMD, Carolin, SudokuExplorer, morgannamodeaura, Nickyo, codewizard, Nylimb, Just me, Marian, martin1456, sandmoppe
Full list

Comments

on 24. June 2022, 14:48 by ibag
Sehr schön mal wieder!

on 30. April 2022, 06:26 by Richard
Added links for online solving. Thx for providing these!

on 27. April 2022, 09:54 by Playmaker6174
Beautiful puzzle! The ending held me off for a while but the combination of some clues eventually resolved it :)

Last changed on 27. April 2022, 09:08

on 27. April 2022, 08:11 by henrypijames
Penpa+: https://tinyurl.com/lmd0009p5

2⅔ stars difficulty - actually easier than last week's.

on 27. April 2022, 00:43 by Steven R
CTC: https://tinyurl.com/3mzzaxmu
F-Puzzles: https://f-puzzles.com/?id=yye3ho8r

Last changed on 27. April 2022, 06:20

on 27. April 2022, 00:11 by cdwg2000
Aha, and this variant is similar,

https://logic-masters.de/raetselportal/raetsel/zeigen.php?Id=0005al
---
Reply: when I created SVS #338 I already made a note that a variant in which the smallest of the two digits is used might solve totally different and thus would be a fun one on the list too. And here it is. :-)

Difficulty:3
Rating:92 %
Solved:79 times
Observed:5 times
ID:0009P5

Puzzle variant Online solving tool

Enter solution

Solution code:

Login