Logic Masters Deutschland e.V.

Mikata

(Published on 10. August 2026, 19:37 by DimitriG)

I came up with these rules while experimenting with the basic idea of Yin-Yang puzzles. I designed them independently, although I strongly suspect that something similar — or perhaps even exactly the same thing — already exists somewhere in the puzzle world!
So I decided to create a puzzle with these rules and share it here to see what experienced solvers think of the concept.
I would be very interested in any feedback, both on the rules themselves and on the puzzle. I also have absolutely no idea how difficult this puzzle should be rated. I hope it isn't completely trivial, at least!
Thanks for giving it a try, and I hope you enjoy it.

Rules :
* Divide the grid into two regions.
* All cells in each region must be connected horizontally or vertically.
* No 2×2 area may be entirely contained in the same region.
* Each Mikata clue shows how many cells in its surrounding 3×3 area belong to the same region as the clue itself.
* The clue cell is included in the count, and cells outside the grid are ignored.
* The colour of a Mikata clue is not given. You must determine which region it belongs to.
* The two regions may have different sizes.
* The two colours are interchangeable.


Play here

Solution code: For row 6, call the colour of the first cell **A** and the other colour **B**, then write the sequence of colours from left to right.

For example, if the row contains three cells of the first colour followed by four cells of the other colour, the solution code would be:

AAABBBB

Last changed on on 11. August 2026, 14:20

Solved by tryote, Calesch, CHalb, TheZwierz, sehringdipity, toxicfig, ildiko, johnyzzh, hanna_werner, Xazzops, perspicacity101, LabRat
Full list

Comments

on 11. August 2026, 14:20 by DimitriG
typo again

on 11. August 2026, 11:56 by CHalb
Für mich eine neue Variante. Gefällt mir sehr gut.

on 10. August 2026, 20:58 by DimitriG
Édit typo

Difficulty:3
Rating:N/A
Solved:12 times
Observed:1 times
ID:000UAB

Puzzle variant

Enter solution

Solution code:

Login