Soap Opera
(Eingestellt am 28. Januar 2024, 21:19 Uhr von Jay Dyer)
Rules
- Each row/column/box contains the digits 0-9 once each. To enable this, each row/column/box contains a single S-cell, which contains two digits. All other cells contain one digit.
- Two digits are considered 'connected' if they share an S-cell somewhere in the grid. In the finished puzzle, every digit must be reachable from every other digit by following one or more of these connections.
- Along a line, the sum of digits on the line is the same in each region the line passes through. Different lines may have different sums.
Solve in Sudokupad.
Lösungscode: Row 7 (write both digits for the S-cell, smallest first)
Kommentare
am 20. September 2024, 08:53 Uhr von koXx
A masterpiece indeed and very hard towards the end! However, it was so satisfactory at the same time when you finally cracked that last key step! Absolutely brilliant, thank you very much Jay!
am 16. Juni 2024, 00:19 Uhr von quantumquark1
This took me more than 3 hours to solve and I loved every second of it
am 24. April 2024, 03:18 Uhr von ONeill
Very hard, very nice!
am 19. März 2024, 14:49 Uhr von Silverstep
Intricate break-in.
am 31. Januar 2024, 20:43 Uhr von peacherwu2
Worth every minute of it!!!!!!!
am 30. Januar 2024, 10:24 Uhr von marcmees
As usual with a jay dyer puzzle, an incredibly rewarding solve. Thanks
am 30. Januar 2024, 03:30 Uhr von gfoot
Brilliant, it got really hard towards the end
am 30. Januar 2024, 01:56 Uhr von samuel1997
This is quite quite incredible! I definitely love it!
am 29. Januar 2024, 19:16 Uhr von Jay Dyer
@samuel1997 For the rule, every digit must be reachable from every other digit. In your example, 9 can only reach 8 through the 89 S-cell, and 1 can only reach 0 and 2. So it is true that every digit must appear, but the connections must also make paths between all the digits.
am 29. Januar 2024, 18:31 Uhr von samuel1997
Hi Jay, I was trying to comprehend the rules with the additional information from comment but still can't quite get it. Would this example {89, 89, 67, 67, 45, 34, 35, 01, 02} work? As 89 <-> 89; 67<->67; 34<->45<->35; 01<->02? Also, does the rule means every digit must appear at least once in one of the S-cell?
am 29. Januar 2024, 12:37 Uhr von Myxo
Stunning puzzle, I absolutely loved it!
am 29. Januar 2024, 09:43 Uhr von Vebby
@h5663454: The sequence you mentioned is one possibility but it does not have to be like that. For example, {01, 02, 03, 04, 05, 06, 07, 08, 09} would be a valid set of S-cells since all digits are connected through 0.
@bansalsaab: An S-cell contains two digits, so those two digits are "sharing the S-cell". Imagine an S-cell as two cities (digits) connected by a road. The puzzle requires that with the information from the nine S-cells, all cities (digits 0-9) must be connected by roads i.e. one can travel from any city to any city. There are various possible road networks as stated above.
am 29. Januar 2024, 08:57 Uhr von h5663454
I'm not sure, but I guess this part of the rule means:
All s-cells must form a sequence similar to the following:
…→ab→bc→cd→de→ef→fg→gh→hi→ia→…
Right?
am 29. Januar 2024, 08:47 Uhr von Vebby
Awesome!
am 29. Januar 2024, 03:34 Uhr von bansalsaab
Hi Jay, can you please elaborate on the connection and reachability? I also didnt understand what sharing S cell means. Thanks.
