Logic Masters Deutschland e.V.

Siamese Coral (2)

(Published on 9. March 2023, 00:10 by KNT)

Two corals are to be drawn in the grid: each coral is orthogonally connected, contains no 2x2 area, and does not 'lock in' any cells; that is, for each coral, all orthogonally connected groups of cells that do not belong to itself are orthogonally connected to the boundary. The corals may not have any cells in common.

One of the two corals is entirely comprised of numbers from 1 to 9, and no numbers may be placed elsewhere in the grid. Numbers must not repeat in any row or column. Clues outside the grid indicate the sums of connected groups of numbers in the respective row or column, where cells not on the number-coral serve as delimeters between groups. The sums are given in ascending order, not order of appearance.

Clues to the right and bottom indicate the lengths of coral segments for one of the two corals, in ascending order. Different rows and columns may provide information on different corals, but no row or column contains information mixed from both corals.

The letters from ANTHOZOA OCTOCORALLIA replace numbers from 0 to 9, and no two letters may replace the same number. However, one such letter is a wildcard and replaces a different number from 0 to 9 every time it appears. A question mark can be any number from 0 to 9, and for all clues, none may have a leading zero.

SudokuPad

penpa+

Solution code: Row 10, Column 13. K for empty coral, X for neither coral, otherwise the digit

Last changed on on 20. July 2024, 04:06

Solved by Myxo, Jesper, polar, Vebby, Niverio, rmn, Koalagator2, MicroStudy, ONeill, wooferzfg, Jakhob, jkuo7, wisty, Alex, cha, AnnaTh, Jaych, lupo, ibag, Zzzyxas, Statistica, akamchinjir, Agent, pkp, zuzanina, ffricke, Xendari, Paletron, lerroyy, Nick Smirnov, Piatato, h5663454, XIAOYING, Las4one
Full list

Comments

on 7. August 2024, 23:36 by Piatato
A fabolously epic puzzle! Masterfully crafted, with wonderful surprises around every corner :D

on 20. August 2023, 08:03 by Xendari
two of them

on 11. July 2023, 21:25 by ffricke
What a wonderful adventure. t took me three attempts to the final solution, but no one was without a plenty of fun.

on 29. June 2023, 09:22 by zuzanina
Fantastic!! :-D

on 20. May 2023, 21:53 by Agent
Excellent puzzle, and quite possibly one of the hardest I've ever solved. It was very rewarding and interesting how the coral connectivity worked out.

on 15. April 2023, 17:41 by ibag
Wow - just like AnnaTh said: A true masterpiece!

on 25. March 2023, 18:09 by AnnaTh
What a masterpiece! I was intimidated by the comments, but the corals looked so promising. I got stuck a lot, but couldn't stop. Patient searching for next logic steps definitely helped :-)

on 20. March 2023, 04:52 by cha
It took me two days, but it was worth it

on 16. March 2023, 21:12 by KNT
@Alex Maybe this one was a little bit evil :D

on 16. March 2023, 20:36 by Alex
a 6* from me.

on 16. March 2023, 05:24 by wisty
this puzzle is SO MUCH FUN OH MY GOD one of my favorites from you for sure :)

on 12. March 2023, 22:46 by wooferzfg
Really challenging throughout, but easily one of my favorite puzzles I've ever solved. There were so many awesome connectivity deductions where there was just barely a way to get things to work.

on 11. March 2023, 12:01 by ONeill
Finally made it out the other end :) absolutely incredible puzzle!

on 10. March 2023, 10:26 by Koalagator2
Did not think I would be able to solve, given the ruleset. Absolutely incredible, watching the puzzle slowly reveal it's secrets was incredibly satisfying.

on 10. March 2023, 00:32 by Niverio
Very well constructed! Absolutely incredible solve path.

on 9. March 2023, 09:47 by polar
Pfiffig konstruiert!
Undoubtedly belongs in the LMD Japanese Sums hall of fame.
As always, thank you KNT!

on 9. March 2023, 08:20 by Jesper
Stunning puzzle! Right up there with JS Nurikabe #2 as my favorite KNT puzzles :)

on 9. March 2023, 01:52 by Myxo
Goes on my facebook page. Enough said.

Difficulty:5
Rating:99 %
Solved:34 times
Observed:7 times
ID:000D7Q

Enter solution

Solution code:

Login