Logic Masters Deutschland e.V.

Parity Loop #1

(Eingestellt am 2. September 2023, 12:50 Uhr von Paletron)


Rules:
  • Normal Sudoku rules apply.
  • Draw a single closed loop (without branching or crossing) moving orthogonally through centers of some cells in the grid. The loop travels on cells of the same parity, and when it crosses a border, the parity switches.
  • The loop passes through each circle, and the number in the circle counts the number of cells around it, which are visited by the loop (including itself, maximum of 9).
  • Cells connected by V sum to 5. Cells connected by X sum to 10.

f-puzzles

CTC

Lösungscode: Row 5


Gelöst von Bjd, Onyx, Prince Joffrey, Jesper, efnenu, lvdoutang, Nylimb, Banana, lwhjp, brimmy, Asphodel, CatusDC, misko, tuturitu, KNT, Counterfeitly, Schwupel, nearestneighbour, alanb, Wonderment, yttrio, ... Raistlen, ElChiglia, Uhu, hovestar, humaLautema, Scorn, michaal94, ryanprobably, heliosfant, tess, fca.felix.sudoku, PippoForte, Christounet, sorryimLate, XIAOYING, japanoise_breakfast, h5663454
Komplette Liste

Kommentare

am 14. März 2024, 21:15 Uhr von Christounet
Fun puzzle ! Thanks :)

Zuletzt geändert am 9. September 2023, 18:46 Uhr

am 9. September 2023, 18:46 Uhr von geronimo92
@Catus DC : was it really necessary to submit the same comment three times? (what about moderators here....)
@Prince Joffrey : certainly not in my own case....

am 9. September 2023, 02:18 Uhr von tesseralis
another fantastic paletron original ^_^

am 8. September 2023, 01:52 Uhr von Xendari
awesome puzzle!

am 4. September 2023, 13:22 Uhr von Schwupel
Very nice trip to solve it!!!

am 3. September 2023, 22:07 Uhr von CatusDC
Very nice trip to solve it!! Congrats :)

am 3. September 2023, 19:20 Uhr von CatusDC
Very nice trip to solve it!! Congrats :)

am 3. September 2023, 14:36 Uhr von CatusDC
Very nice trip to solve it!! Congrats :)

am 2. September 2023, 16:36 Uhr von Prince Joffrey
2 years watching CtC and all of a sudden I can solve Loop-puzzles :-)

Schwierigkeit:3
Bewertung:95 %
Gelöst:106 mal
Beobachtet:2 mal
ID:000F0N

Lösung abgeben

Lösungscode:

Anmelden