Logic Masters Deutschland e.V.

Opposite Loop

(Published on 19. June 2025, 21:22 by brainteaserartisan)

Following a few months away from publishing puzzles—due to a combination of other commitments and several discarded attempts I was unhappy with—I recently found time to resume setting, and the result, with which I am quite pleased, is the next puzzle in my loop series.

Puzzles in the series:

1. Whispering Loop
2. Parity Loop
3. Polarity Loop
4. Opposite Loop

Enjoy!



Rules:
  • Normal sudoku rules apply.
  • Digits in cages cannot repeat and must sum to the clue in the corner, if given.
  • Digits separated by a white dot must be consecutive. Not all dots are necessarily given.
  • Digits along the arrow must sum to the digit in the attached circle.
  • Digits along the thermometer must strictly increase from the bulb end.
  • Numbered rooms clues outside the grid indicate the digit that must to appear in the Nth cell in the corresponding direction, where N is the digit appearing in the first cell in that direction. For example, if R3C9 were a 3, then R3C7 would be a 5.
  • Draw a one-cell-wide loop of orthogonally connected cells that must pass through every cell of every cage without visiting any cage more than once. The loop cannot touch itself orthogonally but may touch itself diagonally. The loop acts as a polarity line, meaning adjacent digits must alternate between low (1, 2, 3, 4) and high (6, 7, 8, 9).
Solve the puzzle here.

Comments are welcome, but please be kind.

Solution code: The sum of the low digits on the loop in boxes 3 and 8

Last changed on on 20. June 2025, 06:27

Solved by ludvigr04, mnhuik, Pierr3, Calesch, LehanLehan, SKORP17, PippoForte
Full list

Comments

on 20. June 2025, 21:19 by VitP
pretty much an experts-only (*) puzzle, so level 3

(*) with polarity loops

on 20. June 2025, 06:27 by brainteaserartisan
A minor ambiguity in the loop path was identified and has been resolved through a small adjustment to the puzzle layout. The solve path remains unchanged.

Difficulty:2
Rating:N/A
Solved:7 times
Observed:1 times
ID:000NVJ

Puzzle variant Online solving tool

Enter solution

Solution code:

Login