Logic Masters Deutschland e.V.

Dexter's Laboratory

(Eingestellt am 25. April 2024, 02:49 Uhr von oxjphs)

Rules:

Normal Sudoku rules apply.

Draw nine non-branching orthogonal paths (lines connecting cell centers horizontally or vertically). Each path N (for N = 1 to 9) starts in one cell with digit N and ends in a different cell with digit N. Each path makes exactly N turns.

Paths turn only when entering a cell with a given diagonal line and cannot pass straight through those cells. Paths cannot start or end in a diagonal-line cell.

Paths may cross each other anywhere except at the starting or ending cells of any path (including their own). For paths 7, 8, and 9, the sequence of digits along the path (from start to end) forms a palindrome.

You can play this puzzle on Penpa+ using the following link. Answer check is triggered if you fill in all digits in the grid in green.

Penpa+

Lösungscode: Enter the digit in row 3 (left to right) followed by the digits in column 3 (top to bottom).

Zuletzt geändert am 17. Juli 2026, 23:18 Uhr

Gelöst von MonsieurTRISTE, Tacosian
Komplette Liste

Kommentare

am 17. Juli 2026, 23:18 Uhr von oxjphs
Rule Clarification.

am 17. Juli 2026, 23:16 Uhr von oxjphs
Rule clarification.

Zuletzt geändert am 8. Dezember 2024, 18:11 Uhr

am 8. Dezember 2024, 18:10 Uhr von Tacosian
@MonsieurTRISTE This puzzle was definitely posted before. It seems the original was deleted. I've just re-entered the solution code from my solve the first time it was posted. :)

am 26. April 2024, 05:16 Uhr von MonsieurTRISTE
Did you copy this puzzle from somewhere else? I’m sure I have solved exactly the same puzzle in this site.

am 25. April 2024, 14:34 Uhr von Maxima
Nondivergent = doesn‘t cross itself?

am 25. April 2024, 06:51 Uhr von MonsieurTRISTE
I think I have seen a very similar puzzle before, using the CTC link…

am 25. April 2024, 03:50 Uhr von oxjphs
link fix

am 25. April 2024, 02:51 Uhr von oxjphs
misspelling

Schwierigkeit:4
Bewertung:N/A
Gelöst:2 mal
Beobachtet:16 mal
ID:000HTN

Variantenkombination

Lösung abgeben

Lösungscode:

Anmelden