Logic Masters Deutschland e.V.

Fillomino rules apply: fill the grid entirely with polyominoes (groups or orthogonally connected cells) and mark each cell of every polyomino with a digit corresponding to the polyomino's size. (E.g. a polyomino of size 3 consists of three orthogonally connected cells, each containing the digit 3.)

No straight horizontal or vertical path between two N-sized polyominoes may cross any less than N other polyominoes; multiple entries into the same polyomino would only count as one pass. Every N-sized polyomino must have at least one 'relative' of the same size; there's at least one straight path between any two 'relatives' which travels through N other polyominoes exactly. (E.g. any polyomino of size 3 must have at least one other polyomino of size 3 exactly three polyominoes over.)

Cells connected by a V sum to 5. Cells connected by an X sum to 10. All Vs and Xs are given.

Note: Make sure you switched off all hints for the most authentic experience!

CTC Link (with the correct solution uploaded)