Logic Masters Deutschland e.V.

What Am I Missing?

(Eingestellt am 15. September 2025, 08:00 Uhr von Kaktuslav)

Link to SudokuPad: https://sudokupad.app/v1erdx85gx



Rules: Fill the 8×8 grid with digits 1–9 so that each row and column contains eight different digits, i.e. exactly one digit is missing from every row and every column. Moreover, no two columns are missing the same digit (note there is no similar assumption about rows). On vertical lines, adjacent digits must sum to the digit missing from that column. On horizontal lines, adjacent digits must differ by the digit missing from that row.

Lösungscode: Negative diagonal (top-left to bottom-right, no spaces)

Zuletzt geändert am 15. September 2025, 12:23 Uhr

Gelöst von sanabas, clock, dr_nectar, Sollun, tiuhto, SKORP17, sze, IcyFruit, 5381, Debrutsid, Exigus, welgen, zrbakhtiar, MixedMathialArts, geftus, RedBarchetta, paranoid, Krisonium, drf93, mir85, karlmortenlunna, QuiltyAsCharged, Ton, abysszealot, Lussie, koXx, Crulamin, wormbrain, phoegon, kasperd, knight_gx, widjo, Zaitam, effervescentblizzard, guirigui, simontherry, FroodOfHoops
Komplette Liste

Kommentare

am 1. September 2026, 12:58 Uhr von simontherry
Much harder than expected, I needed a lot of bifurcation for this one. Must be something I didn't quite get about the puzzle. Went smooth until I got all columns, and then had to try a lot of combinations that turned out to be wrong to eliminate options

am 8. Juni 2026, 02:20 Uhr von kasperd
This puzzle is a lot easier once you read the rules correctly.

For the longest time I thought the difference rule applied in both directions. And I didn't understand how this could be rated any less than five stars for difficulty.

am 16. September 2025, 16:10 Uhr von Exigus
Very interesting concept, not too hard with a bit of goodliffing. Thanks!

am 15. September 2025, 12:23 Uhr von Kaktuslav
Emphasizing that there is no assumption about rows

Schwierigkeit:2
Bewertung:89 %
Gelöst:37 mal
Beobachtet:6 mal
ID:000P26

Rätselvariante Neu

Lösung abgeben

Lösungscode:

Anmelden