Logic Masters Deutschland e.V.

Twofold Shading

(Eingestellt am 14. November 2024, 14:30 Uhr von Sotehr)


PUZZLE


RULES

Sudoku: Normal Sudoku rules apply; place the digits 1-9 once in every row, column, and 3x3 box.

Yin Yang: Shade some cells such that all shaded cells are orthogonally connected, all unshaded cells are orthogonally connected, and no 2x2 area is fully shaded or fully unshaded.

Double: The value of shaded cells are double their digit.

Arrow: The value of a cell with an arrow counts the number cells seen in the direction indicated by the arrow that share its shading, with sight blocked by a cell of opposite shading. Arrows do not count themselves.

Circle: A value in a cell with a circle counts the number of unshaded cells seen in its surrounding 3x3 area, including itself.

Square: A value in a cell with a square counts the number of shaded cells seen in its surrounding 3x3 area, including itself.

Region Sum Line: Blue lines are divided by the 3x3 box borders into sums of equal value.

Equality Loop: Cells on a gray loop an equal distance apart have the same value, e.g. r1c1 has the same value as r3c2.

NOTES
Expected Difficulty: 2.5 stars

This was set for Scojo's Setting Saturday Prompt, this week chosen by the Wheel: Yin-Yang and Doublers!


Play Twofold Shading on SudokuPad.

Lösungscode: Row 5, shaded cells only.

Zuletzt geändert am 14. November 2024, 15:15 Uhr

Gelöst von 9Rookienumbers, efnenu, redgecko, dogfarts, roflsalot, Jacsn, jkuo7, wuc, Piff, Asphodel, karlmortenlunna, Scojo, Calesch, unlogical, aeusuke, NeroChaos, Baklin, zrbakhtiar, NEWS, psninn, Fenn, Paletron, MorsBe, ttennyson115, elpadrinoIV, ocarr, vmirandaa, Drewpacabra, Ppaatt, mse326, cmatthews30, Nairurian, Chad, bulguline, Zenryo, Drafuf, det, teatufs, oskode, abadx, macronate
Komplette Liste

Kommentare

am 15. November 2024, 22:19 Uhr von wuc
Cool puzzle. Flows nicely with constant difficulty. Loved it thx.

Schwierigkeit:2
Bewertung:97 %
Gelöst:41 mal
Beobachtet:4 mal
ID:000KQW

Rätselvariante Neu

Lösung abgeben

Lösungscode:

Anmelden