Logic Masters Deutschland e.V.

Loop de Loop de Loop

(Eingestellt am 13. Dezember 2025, 05:33 Uhr von RandyDan)

Rules:

Fill each cell in the grid with a digit 1-9. Digits cannot repeat in a row, column, or 3x3 box.

Draw three one-cell-wide loops of orthogonally connected cells. Each loop cannot touch itself, not even diagonally. Loops overlap at '+' indicators (either by meeting at right angles or by passing through each other), and cannot overlap in any other cells in the rest of the grid.

German Loop: One of the loops is a German Loop. Adjacent digits along a German Loop must differ by at least 5.

Parity Loop: One of the loops is a Parity Loop. Digits along a Parity Loop alternate odd/even.

Thermo-Loop: One of the loops is a Thermo-Loop. Whenever a Thermo-Loop travels vertically, the northern digit is greater than the southern digit. Whenever a Thermo-Loop travels horizontally, the eastern digit is greater than the western digit.

Squares: Cells containing a square cannot be on the German Loop (but may or may not be on other loops) and count the number of German Loop cells they touch (both orthogonally and diagonally).

Circles: Cells containing a circle cannot be on the Parity Loop (but may or may not be on other loops) and count the number of Parity Loop cells they touch (both orthogonally and diagonally).

Play on SudokuPad

Lösungscode: Row 7


Gelöst von jmw, SKORP17, IrishDevil, Isael, SPring
Komplette Liste

Kommentare

am 13. Dezember 2025, 15:05 Uhr von RandyDan
Pairs of loops overlap in the + cells, and there can be no overlap at all in the other cells.

am 13. Dezember 2025, 10:28 Uhr von Philologos
When the rules state that “Loops overlap at + indicators [...] and cannot overlap in any other cells”, does this mean all three of them must overlap in each cell with a +, and not even two of them can overlap in any other cell? That’s my reading, but I am pretty sure that’s impossible.

Schwierigkeit:4
Bewertung:N/A
Gelöst:5 mal
Beobachtet:0 mal
ID:000QJC

Rätselvariante Wegerätsel

Lösung abgeben

Lösungscode:

Anmelden