Triple Tapa
(Published on 28. November 2025, 21:47 by Nell Gwyn)
- Yin-Yang-Yong: Divide the grid fully into three orthogonally-connected regions, such that no 2x2 area is entirely within a single region.
- Tapa (Variant): Clues represent the contiguous blocks of cells in the (up to 8) cells surrounding the clued cell that belong to a different region from the clued cell.
- Each clued run of cells belongs to a single region (e.g. a clued cell in region A with a run of 2 cells in region B and 3 in region C will have two clues of 2 and 3, not one clue of 5). See the example image for clarifications.
Solution code: For each column from left to right, give the number of horizontal region borders within that column (in the example puzzle, the solution code would be 1542531).
Solved by nuzzopa, r45, kays, Paletron, Menderbug, Jesper, Qodec, misko, cyddrdrd, SXH, psninn, NEWS, MonsieurTRISTE, steeto, CutieRainbow, kdwji, puzzler05, smckinley, ns08, proNoob, karlmortenlunna, SKORP17, Mark Sweep, QuiltyAsCharged, tuturitu
Comments
on 7. January 2026, 15:09 by QuiltyAsCharged
Very nice! Requires thoughtful consideration of the big picture.
If you get stuck, a little birdie whispered these strange words to me: zetamath sudoku stream #384
on 3. December 2025, 14:49 by cyddrdrd
Nice!!
on 3. December 2025, 14:49 by MonsieurTRISTE
The trick and only the trick.
on 1. December 2025, 00:39 by Qodec
And suddenly the clouds vanished, and the bright sun made us see with clarity and wonder.
