Logic Masters Deutschland e.V.

X-scrapers

(Published on 2. February 2026, 09:56 by vidarino)

X-scrapers

Rules:

  • Normal sudoku rules apply: Put the digits 1-9 into every row, column and 3x3 box.
  • Kropki dots: Digits separated by a white dot must be consecutive.
  • X-scrapers: Clues outside the grid indicate "X-scapers". The digit immediately next to the clue indicate how many digits are visible from that direction in its row/column, where higher digits obscure the view of lower digits. The clues outside the grid represent digits of the sum of the visible digits, if given. A question mark can be any digit.

Example:

17 | 3 1 5 | 2 4 9 | . . . |
The 3 next to the clue says that only three digits are visible in the row. The 1 is hidden by the 3, and 2 4 are hidden by the 5, so the sum of the visible digits is 3 + 5 + 9 = 17

Play:

SudokuPad: https://sudokupad.app/z3mvkpibxy

Solution code: Row 6

Last changed on on 2. February 2026, 10:07

Solved by gdc, marcmees, bansalsaab, cornish-john, SKORP17, by81996672, SirWoezel, flutchman, KlausRG, Statistica, StefanSch, Jesper, zonka
Full list

Comments

on 3. February 2026, 15:04 by flutchman
Very hard for me, but it came together beautifully. Nice work!

on 2. February 2026, 15:32 by marcmees
Very nice puzzle with cool restrictions for a great logical solve without being a walk in the park. Thanks

on 2. February 2026, 12:44 by vidarino
flutchman: The first digit is never zero. There aren't any X-scrapers that would give a single-digit sum anyway. :)

And correct, they always stop at the 9. The first digit only says how many digits are visible, not how far to look.

Last changed on 2. February 2026, 12:34

on 2. February 2026, 12:26 by flutchman
May I assume that the first question mark is never a zero?
I.e. ?? could mean 30, but not 03

And now that I think of it: does the skyscraper always stop at 9? Or does the first digit simply define how far to look.

E.g. 45679 would be fine and would sum 4567, or would that sequence be simply invalid for any clue?

Difficulty:4
Rating:86 %
Solved:13 times
Observed:0 times
ID:000R9L

Enter solution

Solution code:

Login