## American Whispers - purpl Collab

(Eingestellt am 20. Februar 2022, 14:37 Uhr von the_cogito)

Had a lot of fun setting this puzzle with purpl and encourage you to check out his puzzles, he sets some really cool stuff :)

Rules:
- Normal-ish sudoku rules apply. Place the digits 0-9 in each row, column, and box. To enable this, one cell in each row, column, and box will contain exactly two different digits, a Schrödinger cell.
- Adjacent digits along a red line must have a difference of at least 8, yes that's right 8.
- For a Schrödinger cell along this line, the sum of the digits in that cell must have a difference of at least 8 from its neighboring cells along the line.

Solve with CTC app here

Lösungscode: In order from rows 1-9, the digits in every Schrödinger cell, with the smaller digit coming before the larger digit in each cell.

Gelöst von Playmaker6174, PrimeWeasel, PulverizingPancake, XeonRisq, Nylimb, Blake Saligia, bolado, alcarinquo
Komplette Liste

### Kommentare

am 12. April 2022, 08:19 Uhr von Hausigel_mod
Labels/Tags changed

am 22. März 2022, 03:22 Uhr von XeonRisq
My issues with S-cells continues ... LOL
I broke the puzzle a few times because my mind just won't allow 10 digits into a row/column/region so I kept leaving out candidates.
After I reset my brain a few times, I was able to get to a finished, "correct" grid.
Very nice puzzle, excellent construction!

am 22. März 2022, 02:09 Uhr von XeonRisq
My issues with S-cells continues ... LOL
I broke the puzzle a few times because my mind just won't allow 10 digits into a row/column/region so I kept leaving out candidates.
After I reset my brain a few times, I was able to get to a finished, "correct" grid.
Very nice puzzle, excellent construction!

am 21. März 2022, 22:09 Uhr von PrimeWeasel
Quite a nice solve, should get some more!

am 20. Februar 2022, 18:33 Uhr von Playmaker6174
A very smooth and neat solve once I started to wrap my mind around it, particularly like that one deduction that resolved the rest of the grid :)

 Schwierigkeit: Bewertung: N/A Gelöst: 8 mal Beobachtet: 0 mal ID: 00096I

Lösungscode: