Yay crazy hybrids! I guess this one is kind of hard.

Draw a loop through adjacent vertices that cannot intersect itself. For each pair of symmetrically placed numbers, one is a Slitherlink clue which indicates how many of the four edges around it are drawn, and one is a Contact clue which indicates the total length of all straight segments adjacent to it where segment length is always measured up to the nearest turns in the loop.

(This was a WordPress bug that should no longer be relevant.)

A Naoki Inaba (JP) type, as seen on Para’s Puzzle Site.

Draw a loop through adjacent vertices that cannot intersect itself; each number indicates the total length of all straight segments adjacent to it, where segment length is always measured up to the nearest turns in the loop.

Let’s see how well WordPress’s scheduling works again. Happy Chinese New Year!