PDF

or solve online (using our beta test of Penpa-Edit tools)

Theme: C Sharp

Author/Opus: This is the 43rd puzzle from our contributing puzzlemaster Serkan Yürekli.

Rules: Shade some empty cells black to form a set of dominoes (1×2 rectangles) that divides the grid into white regions; the dominoes cannot overlap or share an edge. Each region must contain exactly one type of given letter, and must also contain all instances of that letter (i.e. there cannot be two regions that contain C). See also this example:

Answer String: Enter the length of the unshaded segments in order in the marked rows/columns. Separate the groups with a comma. For this example, the answer is “25,132”

Time Standards (highlight to view): Grandmaster = 3:30, Master = 5:30, Expert = 11:00

Solution: PDF