Logic Masters Deutschland e.V.

Little Latin Loopy Lu

(Published on 14. October 2024, 22:10 by Flinty)

Initial Setter Difficulty: 3/5 - Potentially 2/5 after review.

Special Thanks
This puzzle was set for the weekly Scojo discord prompt, and it was a channel points redeem by Prof.Dori to make a loop/snake puzzle with a limited number of clues.

Normal Sudoku rules apply.
Place the digits 1-9 so that they do not repeat in any row, column, or 3x3 box.

Loop
Shade some cells to form a 1-cell-wide orthogonally connected loop. The loop may not touch itself orthogonally or diagonally.

Circles
All circles are on the loop, and the digit in the circle counts how many loop cells are seen orthogonally, including itself, with non-loop cells blocking vision.

XV
All orthogonally connected digits within each box on the loop must form a valid X or V clue, where adjacent digits sum to 10 or 5. This rule does not apply on box borders.

To play this puzzle please click here: Play CTC

Hint to Start

Due to the XV rule, the amount of cells you can visit within a box is very limited.

This Weeks Puzzle

Solution code: Digits not on the loop in Row 7 (with no spaces or special characters).

Last changed on -

Solved by sujoyku, palpot, goodcity, sarabtx, Alce, HertogHJ, widjo, Vodakhan , sorryimLate, tiredsudoku, Mr. Happy, Piff, Franjo, HazelTheColor, gdc, gotem, Felis_Timon, glum_hippo, Prof.Dori, Scojo, Genomico, Calesch, Zorzi, Sinuit, Piterku, Zandi, trashghost, Tompzini, little_arturo, utsavb, Crul, gadgetgreen, Cosinus, petecavcc, vmirandaa, asii, Lovejoy , maniacaljackal, teuthida, zrbakhtiar
Full list

Comments

on 18. October 2024, 12:01 by Cosinus
Beautiful! Thanks a lot!

on 15. October 2024, 19:37 by gdc
found the ideas in this very unique and fun. Thanks for that!

on 15. October 2024, 01:30 by sorryimLate
The constraints are so powerful that I think this is a very smooth 1* puzzle. Thanks for sharing!

on 15. October 2024, 00:17 by HertogHJ
Nice puzzle!

Difficulty:2
Rating:97 %
Solved:40 times
Observed:0 times
ID:000KA1

Enter solution

Solution code:

Login