Logic Masters Deutschland e.V.

Schrödinger's Doublers

(Eingestellt am 13. Juli 2023, 18:31 Uhr von Oddlyeven)

What if Schrödinger's box was opened and there were two cats?

Rules: Put the digits 0 to 6 in every row, column and box.
Schrödinger Cells: One cell in every row, column and box is a Schrödinger cell that contains two digits. This cell's value counts as the sum of its digits for the following rules.
Doublers: One cell in every row, column and box is a doubler. This cell counts as double its value for the following rules. Each of the digits 0 to 6 appears exactly once in the set of doubler cells.
Region Sum Lines: The sum of the values on a line within a box must be the same for each box that line passes through.

Links:
SudokuPad: https://tinyurl.com/4rm5n48w

The 9x9 sequel:, Schrödinger's Triplers

Lösungscode: Row 1, left to right. (7 digits. For the Schrödinger cell list the smaller digit first.)

Zuletzt geändert am 23. Juli 2023, 15:55 Uhr

Gelöst von Tulrak, gdc, efnenu, AzureFire, Kenro, SenatorGronk, Christounet, CrippledLamp, giladooshlon, Mr_tn, AKernel, aaalexx, Silverscree, Anteros, HumanBirdsong, Flambierter Flamingo, smckinley, ... lmtierney, Yann, bramhaag, LapsedMemory, lmdemasi, heliopolix , Uhu, michaal94, dtoto, diziet, yeeko, PatientMustard, humaLautema, teuthida, PippoForte, Krisonium, Luaryo, GhTheOne, herrdoktorfloof
Komplette Liste

Kommentare

am 15. August 2023, 08:44 Uhr von mse326
@asp1310 Oddlyeven answered your question, but in the future if you encounter a ruleset like this the first thing I personally do is think about how many digits and/or values have to be in modified squares. Doing that there are 7 digits in this puzzle and per the rules each one must be in a doubler cell. If a doubler couldn't be an S cell the most digits you could accomodate is 6 so it is logically required. I only add this because some constructors will want you to figure that out so won't answer that question in the rules or an answer.

am 4. August 2023, 17:51 Uhr von fecske
The 1st step was easy for me, and it gave an idea how the rules will work. The 2nd step was the hardest and I concluded a few times that this puzzle is impossible. Once I figured that step out it was a straightforward solve from there.

Nice logic, interesting rules. Well done.

Zuletzt geändert am 25. Juli 2023, 15:06 Uhr

am 24. Juli 2023, 22:26 Uhr von asp1310
Can S-cells also be doublers? This isn't clear. I.e. Can a [04] cell equal 8?

(Note: I'm not asking if this does actually happen. More if the rules allow it in the first place, or if the S-cell and doubler cell are - by the rules - two different cells.)

It is allowed - Oddlyeven

am 23. Juli 2023, 15:55 Uhr von Oddlyeven
Added link to the sequel.

am 17. Juli 2023, 03:44 Uhr von fitzie
These rules are great. I understood them entirely, but still thought the solve was impossible until I understood them just a tad more :)

am 14. Juli 2023, 20:53 Uhr von prodigis
What a beautifully executed idea, looking forward to the bigger version

am 14. Juli 2023, 13:24 Uhr von Oddlyeven
Updated wording on region sum line rules.

am 14. Juli 2023, 13:02 Uhr von Cane_Puzzles
Really enjoyed this, thanks!

am 14. Juli 2023, 13:00 Uhr von Senip
Thanks for the wonderful puzzle!

Zuletzt geändert am 14. Juli 2023, 13:24 Uhr

am 14. Juli 2023, 10:43 Uhr von drbs
Shouldn't it read: "Region Sum Lines: The sum of the cell values ..." instead of "... sum of the digits ..."?

Good catch! Changed - Oddlyeven

am 14. Juli 2023, 00:15 Uhr von HumanBirdsong
Great stuff, as always! Had a good chuckle at the s-cells in the finished grid.

am 14. Juli 2023, 00:01 Uhr von Silverscree
I really enjoyed how smooth this was. I love a good 6x6 :)

am 13. Juli 2023, 21:28 Uhr von giladooshlon
Double the Schrödinger, double the fun!

Zuletzt geändert am 23. Juli 2023, 15:55 Uhr

am 13. Juli 2023, 20:32 Uhr von Christounet
Lovely combo ! I love S-cells and doublers. Now the 9x9 maybe ? Thanks !

9x9 is out! - Oddlyeven

Schwierigkeit:2
Bewertung:95 %
Gelöst:123 mal
Beobachtet:3 mal
ID:000EGY

Variantenkombination Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden