Logic Masters Deutschland e.V.

Friendly But Not Too Friendly

(Eingestellt am 23. Juli 2024, 21:29 Uhr von ChinStrap)

Thanks to the CtC discord for helping validate!

Normal sudoku rules apply.

Build a 1 cell width loop that travels orthogonally from cell to cell and never touches itself, even diagonally.

All friendly cells must be on the loop. Non-friendly cells may be on the loop. A cell is friendly if its digit matches its row, column, or box number.

No cell is allowed to be friendly in more than one way. For example, r2c4 cannot be a 2 because it would be friendly by both its row and box.

Cells separated by a white dot are consecutive. Not all possible dots are given.

Click on the image to play

Lösungscode: Row 1

Zuletzt geändert am 23. Juli 2024, 21:33 Uhr

Gelöst von Calvinball, SKORP17, Voidslime, walid_tun, someguy209, Calesch, amarins, MattYDdraig, QuiltyAsCharged, sorryimLate
Komplette Liste

Kommentare

am 16. Oktober 2024, 04:31 Uhr von QuiltyAsCharged
Cool puzzle! Pretty tricky to prove which path the loop must take. "With friends like these, who needs acquaintances?"

am 23. Juli 2024, 21:44 Uhr von Calvinball
Very cool discovery! Tougher than I thought it was going to be going into it, but that only made it more rewarding.

Schwierigkeit:3
Bewertung:N/A
Gelöst:10 mal
Beobachtet:1 mal
ID:000J2Q

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden