Lösungscode: First (highest) row from left to right
am 28. August 2025, 14:45 Uhr von Schmupiter
@apothycus that is exactly the trick. I also saw the same entry on puzzling stack exchange and wanted to create a puzzle where this trick would be useful.
@henrypijames I would also love to see Simon explain this on CTC, I think he never used this trick. I wonder if Simon and Mark are aware of it...
am 22. August 2025, 00:38 Uhr von NRB
For me, I manage to,solve the sudoku with the help of ying Yang constraints, but every time the ying Yang doesn’t work. If the is 3/4 star I think it’s a broken puzzle. After 5 attempts.
am 14. August 2025, 05:45 Uhr von henrypijames
It's a really fascinating trick - that I didn't know, and certainly didn't use to solve this puzzle. I would love to see Simon explain it on CtC.
@apothycus: You forgot a third case: There are no color-separating edge vertices because there is no change of color along the grid edge.
am 7. August 2025, 12:39 Uhr von Martina
So what's the trick?
am 7. August 2025, 05:40 Uhr von henrypijames
I've been able to finish the sudoku with most of the grid still undetermined in terms of YY.
am 6. August 2025, 20:54 Uhr von RBGamer
I did use a few yin-yang tricks, but oh I needed digits to progress the pattern. The beginning was magic, and the final break very hard.
This is my first comment on this page, and I want to thank you Schmupiter for a fun and beautiful puzzle
am 6. August 2025, 08:44 Uhr von Schmupiter
--- Spoiler Warning! ---
.
.
.
Hint: The puzzle is intended to be solved using a (general) trick about Yang-Yang puzzles, that I think, is not very well known. Using this trick, it is in fact possible to solve almost the entire Yin-Yang part without placing a single digit or (digit) pencil mark. It is possible to solve the puzzle without that trick, but it is much much harder that way. (I would say 5/5 without the trick, but something like 3/5 with the trick, that's why I didn't want to set the difficulty to 5/5)
Schwierigkeit: | ![]() |
Bewertung: | 79 % |
Gelöst: | 21 mal |
Beobachtet: | 2 mal |
ID: | 000OK6 |