Logic Masters Deutschland e.V.

Plaid

(Eingestellt am 16. November 2026, 23:22 Uhr von it_depends)

Here’s a puzzle I forgot existed. I was in a super deep rabbit hole of finding patterns between global mod-3 and [something you need to figure out to solve this puzzle]. The result was this conceptually interesting but pragmatically annoying puzzle. Nevertheless, I spent too much time on the logic to not archive it.

Play on SudokuPad

Rules

  • Sudoku. Place the digits 1–9 exactly once in each row, column, and 3×3 box.
  • Global mod-3. Every 2×2 group of cells must contain at least one digit from each of the sets {1,4,7}, {2,5,8}, and {3,6,9}.
  • Column indexers (red). A digit in a red cell in column X indicates the column containing X in that row.
  • Row indexers (blue). A digit in a blue cell in row X indicates the row containing X in that column.
  • White Kropki dots. Cells connected by a white dot contain consecutive digits.

Lösungscode: the sum of all the centre cells of the 9 boxes plus the sum of the main negative diagonal (overlaping cells are counted twice)

Zuletzt geändert am 16. November 2026, 23:24 Uhr

Gelöst von Fisherman, jalebc, Hermien, kangaroo, SKORP17, PippoForte, ggwp
Komplette Liste

Kommentare

am 19. November 2026, 06:17 Uhr von ggwp
i get how this puzzle can seem intimidating to a lot of people especially if they're not familiar with 159/indexing constraints but i would loveee for people to get even more into indexing. this type of puzzle and the patterns it creates are just as beautiful (maybe even more imo) as anti-knight anti-king non-consecutive ones. i would suggest adding the 159 tag to this. very nice puzzle!

Zuletzt geändert am 19. November 2026, 04:05 Uhr

am 19. November 2026, 00:24 Uhr von Fisherman
Penn and Teller style title and intro. No wonder we can't decode the clues. Great show and puzzle. Truly magical. It fooled everyone.

am 16. November 2026, 23:24 Uhr von it_depends
changed solution code

Schwierigkeit:4
Bewertung:N/A
Gelöst:7 mal
Beobachtet:0 mal
ID:000W2T

Lösung abgeben

Lösungscode:

Anmelden