Logic Masters Deutschland e.V.

Yin-Yang Least Squares

(Published on 16. August 2025, 17:07 by henter)

Yin-Yang Least Squares

Also check out Latent Least Squares, Armases cinereum and Linear Least Squares with this constraint.

Rules
  • Normal 8x8 Sudoku rules apply.
  • Shade some cells such that all shaded cells are orthogonally connected, all unshaded cells are orthogonally connected and no 2x2 area is entirely shaded or unshaded.
  • A digit in a circle indicates how many circles contain that digit. Circles are either all shaded or all unshaded.
  • A digit in a square indicates how many squares contain that digit. Squares are either all shaded or all unshaded.
  • Digits on a least squares line sum to the square of the smallest digit on that line. Lines do not branch, cross themselves or share cells with each other and can move orthogonally or diagonally. A single cell is not a line.
  • Least squares lines only visit shaded cells and all shaded cells must be visited by a line.

SudokuPad

Solution code: Row 7


Solved by Joyofrandomness, SKORP17, Snookerfan, Laermans, Tacocat
Full list

Comments

Last changed on 18. August 2025, 10:26

on 18. August 2025, 08:11 by Tacocat
That was very challenging and got harder towards the end. The way the constraints interact is beautiful, thank you for sharing!

---
Thanks for solving, I'm glad you enjoyed it! I was contemplating adding some extra clue to smooth out the end a bit but decided to keep it as it is.

Last changed on 17. August 2025, 17:29

on 17. August 2025, 07:13 by henrypijames
I don't understand: Where are the Least Square Lines?

---
henter: You have to determine where the lines are according to the rules. If you want some hints or pointers let me know, the puzzle is also on the testing channel of the CtC discord.

Last changed on 16. August 2025, 22:58

on 16. August 2025, 22:25 by Snookerfan
Very original and fun puzzle! Thank you

---
Thanks for solving and commenting!

Difficulty:4
Rating:N/A
Solved:5 times
Observed:1 times
ID:000OPG

Enter solution

Solution code:

Login