Logic Masters Deutschland e.V.

Stolen Numerals XVII-Lean

(Published on 19. December 2025, 18:24 by NurglesGift)

Normal sudoku rules apply.

Cells connected by an X must sum to 10.

Cells connected by an V must sum to 5.

The green dots are either X or V.

All X's and V's are given.

Cells connected by an blue square must sum to 7.

All blue squares are given

Leaning Sandwich: Arrows with a number outside the grid indicate the sum of the digits located between the 1 and 9 on the indicated diagonal, There can be only one [1] and one [9] on a indicated diagonal.

All possible leaning Sandwich clues are given.

Link to sudokupad

--------------------------------

Feel free to recommend this puzzle to anyone.

Feel free to take special rules for your own puzzle.

Feel free to give feedback.

Bless you!

---------------------------------

Example


All possible leaning Sandwich diagonals are given on the grid below.

Solution code: give the digits of column 2 (top to bottom)


Solved by GraphZahl81, Marshal on Mars, dogfarts, Onkel_Dagobert, jmw, RedBulls75, SKORP17, thomamas, EFlatMinor, by81996672, sigge, jordanza, elloschmello, richardkchapman, weiken, Cristal, krytolandros, SamWHE, galium_odoratum, S4K, Montinox, Crul, FoulMoodPotato
Full list

Comments

yesterday, 19:27 by FoulMoodPotato
Absolutely beautiful puzzle, thank you!
Happy Holidays to all!

on 19. December 2025, 20:00 by NurglesGift
Congrats and thank you,
I'm not 100% sure you need the negative constraint on the blue squares but I'm sure it gives some small shortcuts in the solve :)

on 19. December 2025, 19:42 by GraphZahl81
Finally I'm the first person to solve a puzzle. ;)
I really liked the leaning sandwich rule, in particular the negative constraint was really interesting.
I don't recall ever using the negative constraint on the blue squares, but I might have just forgotten. And even if it were not necessary, it fits perfectly into the theme of the puzzle.

Difficulty:3
Rating:82 %
Solved:23 times
Observed:0 times
ID:000QM8

Standard puzzle Puzzle variant Variant combination

Enter solution

Solution code:

Login