Here's a puzzle that borrows elements from Schrödinger cells, star battle, and my Suguru Chaos Deconstruction series. If you'd like any hints, feel free to post a hidden comment below or message me on Discord. I've also included a mini-example for clarity. Comments and ratings are much appreciated, and please be sure to check out my other puzzles here.
Fill some cells in the grid with the digits 0–9 so that no digit repeats in a row/column. There are at most two S-cells in each row/column, and they do not touch orthogonally nor diagonally. (An S-cell is a cell that contains two digits simultaneously.)
A number between two cells indicates the difference between the two cells' values. (A cell's "value" is either its digit or, in the case of an S-cell, the sum of its two digits.) A blank square or circle is an unknown even or odd difference respectively.
A cell with a circle/square on an edge has a digit, or digits, in it. All digits belong to a region, a collection of orthogonally connected cells. A region with n cells contains the digits 0 through n+1 once each (i.e. every region contains exactly two S-cells). Regions do not touch each other orthogonally.
Mini-example, where the digits 0–5 are placed instead of 0–9:
Lösungscode: Ignoring blank cells, enter the digits in Rows 7 and 11 (left to right; no spaces; for S-cells, low digit first)
am 23. Juni 2022, 12:14 Uhr von MagnusJosefsson
Great puzzle! Very challenging and enjoyable!
am 21. Juni 2022, 07:10 Uhr von RJBlarmo
This was my first time trying an S-Cell puzzle, very challenging but lots of fun. Always fascinating seeing what kinds of variants you can fit into the SCD series.
am 20. Juni 2022, 23:37 Uhr von mnasti2
So good. I think my longest solve yet but every bit of progress was very satisfying!
am 20. Juni 2022, 20:41 Uhr von Niverio
Incredible, but very tough as well at the same time!
am 20. Juni 2022, 17:58 Uhr von Mody
Was für ein galaktisches Rätsel.
Kein Hinweis zu wenig, aber auch keiner zuviel ;)
What a galactic puzzle.
No clue too few, but also none too many ;)
Thanks Mody as always! -mathpesto
am 20. Juni 2022, 10:04 Uhr von polar
Wonderful puzzle! It's so easy to make a mistake on this one and the combination of variants makes it a delight to solve. Easily my favourite of the suguru series, thanks!
Delighted to hear that, thank you! -mathpesto
am 19. Juni 2022, 22:49 Uhr von Jesper
Very nice and challenging, thanks!
Thank you, Jesper! -mathpesto
am 19. Juni 2022, 18:52 Uhr von crispy16
Excellent puzzle once again. Took a while to get started, but once it did it rolled along really nicely.
Thanks so much! -mathpesto