Logic Masters Deutschland e.V.

Tenable

(Eingestellt am 20. Juni 2025, 21:59 Uhr von jwsinclair)


Tenable, by James Sinclair

Fill each row, column, and box with the digits 0-9 once each. Exactly one cell in each row, column, and box is a "Schrödinger's cell", containing two digits at once.
A cell's value is equal to the sum of its digits.
Divide each line into one or more segments containing values that sum to a (non-zero) multiple of 10, so that every cell on a line is part of exactly one segment.
A value in a circle indicates the number of segments on its line (for counting purposes, lines are divided into the smallest possible increments, e.g. a 1-9-2-8 sequence is considered two segments, not one).
Values in cells with inequality signs are greater than the values in all orthogonally adjacent cells.

SudokuPad

If you want a more conventional ten lines puzzle, check out Au Gratin, the fifth puzzle in Artisanal Sudoku, Volume 180, which, like all previous multiples of 45, is a special edition with bonus puzzles and hints for all :)

Lösungscode: The digits in each Schrödinger's cell (smallest first) in box order starting with box one (18 digits in total)


Gelöst von morrisjb, SKORP17, sorryimLate, Piff, Maximus, oskode, Mr_tn, dumediat, lmdemasi, Flinty, ChinStrap, karlmortenlunna, palpot, aqjhs, Scojo, ViKingPrime, tuoni2, widjo, Isael, fauxturtle, Nell Gwyn, OGRussHood, pescirope, zonka, guirigui, cravenp, Uhu, corrie
Komplette Liste

Kommentare

am 7. Juli 2025, 21:29 Uhr von OGRussHood
Where's Warwick Davis and his corny puns?

am 24. Juni 2025, 02:30 Uhr von ViKingPrime
An impressive display of skill. Schrödingers are not an easy thing to set with, or at least to do so and end up with such a spectacular final product. Wonderful!

am 23. Juni 2025, 02:35 Uhr von Scojo
Loved that. Some very sneaky deductions, and I really liked the final step to resolve everything.

am 22. Juni 2025, 15:54 Uhr von dumediat
Certainly difficult, but very smooth once one asks the right questions. Thank you!

Schwierigkeit:4
Bewertung:95 %
Gelöst:28 mal
Beobachtet:4 mal
ID:000NW1

Lösung abgeben

Lösungscode:

Anmelden