Logic Masters Deutschland e.V.

Mod 4 Sudokuception

(Eingestellt am 30. Dezember 2020, 09:05 Uhr von Zack Szekely)

Hi there! This is my first sudoku puzzle, and I'm extremely proud of it! It's quite hard, but don't worry, it's been thoroughly tested. Feedback is highly encouraged!

Rules:

Normal sudoku rules apply. Sudoku-X rules also apply. This means both of the marked diagonals must each contain all of the digits from 1 to 9.

In addition, the red square and the blue square must both be valid 4x4 sudokus if modular division by 4 (mod 4) was applied to all of the numbers within them. Mod 4 gives the remainder of a number after dividing that number by 4. For instance, 5 mod 4 equals 1, 6 mod 4 equals 2, etc. For consistency’s sake, let’s say that 4 mod 4 and 8 mod 4 are both equal to 4 rather than 0. If mod 4 was applied to all of the digits in the red and blue squares, then each row of 4 cells, column of 4 cells, and 2x2 box should contain the digits from 1 to 4.

The purple cell marks where the red square and blue square overlap, so it is part of both squares. Neither of the two green squares can contain the digit within the purple cell, and both green squares must each contain all eight other digits.

Hint (must highlight to read): 1 purple + 3 red + 3 blue = 7 cells. This could be 7 out of 18 or 7 out of 27 depending on what group of digits you're using.

F-puzzles link

Lösungscode: Row 5 followed by Row 9, no spaces.

Zuletzt geändert am 10. Februar 2021, 12:17 Uhr

Gelöst von Hackiisan, NXTMaster, Megalobrainiac
Komplette Liste

Kommentare

am 20. August 2021, 22:09 Uhr von Hausigel_mod
Labels/Tags changed

am 10. Februar 2021, 12:17 Uhr von Zack Szekely
Revised to change the size of the image and to improve the hint.

am 9. Januar 2021, 10:21 Uhr von Hackiisan
Very hard but enjoyable logic and beautiful break-in! The puzzle feels like it was designed to require a second break-in half-way through the solve...

Schwierigkeit:5
Bewertung:N/A
Gelöst:3 mal
Beobachtet:5 mal
ID:00051O

Variantenkombination Neu Lösungstipps Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden