Logic Masters Deutschland e.V.

Eleven Ns

(Published on 29. January 2026, 12:31 by Team Mays)

Eleven Ns by Nathan Mays

RULES

Normal sudoku rules apply.

N-Sum Lines:
Gray lines can be divided into two or more segments that each sum to N. The solver must determine the value of N for each line.

Sandwich Sums:
A value on the outside of the grid indicates the sum of the digits between the 1 and 9 in its corresponding row or column. One of the sandwich clues is N. The solver must determine the value of N.

Inequality:
The arrow points to the smaller digit.

Global constraint:
All eleven values for N (10 lines plus 1 sandwich) are different, and must be from 10 to 20 inclusive.

PLAY ON SUDOKUPAD

This is my debut puzzle, so feedback is very much appreciated (good and bad).

I've had the basic idea with the 10 lines mulling in my head for many months now, until recently I decided on a way to incorporate the missing value between 10 and 20.

Not all of the "0" sandwich clues are strictly necessary, but in the end I decided to include them all because it looked interesting and it reduced some tedious bifurcation.

The inequality was obviously added in at the end for disambiguation. I'm not happy with that but sometimes that's just the way it is.

Solution code: All 9 digits of column 5, from top to bottom.

Last changed on on 30. January 2026, 10:05

Solved by vollbesonderbar, StefanSch, lianarox, gdc, SKORP17
Full list

Comments

on 30. January 2026, 10:05 by Team Mays
another attempt at fixing the image

on 29. January 2026, 21:27 by gdc
@Team Mays: to include an image, you put <img:XYZ> into the puzzle html. Replace XYZ with the 6-symbol ID from https://logic-masters.de/Dateien/

on 29. January 2026, 12:36 by Team Mays
Still trying to get the image figured out.

on 29. January 2026, 12:34 by Team Mays
Trying to fix the image link
(https://logic-masters.de/Dateien/bild.php?data=f66245b2-46264-62696c64)

Difficulty:3
Rating:N/A
Solved:5 times
Observed:0 times
ID:000R7R

Standard puzzle Variant combination

Enter solution

Solution code:

Login