Masyu: Draw a single loop that travels horizontally and vertically between cell centers and that passes through each clue. It goes straight through white clues, but turns in the previous or the following cell (or both). It turns in black clues, but goes straight through both the previous and the following cell.
No cell must contain exactly the same loop segment in both solutions, and no cell must be empty in both solutions.
Solution code: The sizes of all areas of empty cells that touch the edge of the grid. Start in the top left corner and proceed clockwise. Start with the solution whose code is lexicographically smaller.
on 19. July 2018, 11:38 by AnnaTh
Toll!
on 15. July 2018, 13:11 by rob
Geringfügig klarer formuliert, dass unterschiedlich orientierte gleichförmige Wegabschnitte als verschieden gelten.