Arukone with Crossings (12)

Some cells in the grid are marked with numbers; each number appears exactly twice and no cell contains more than one number. For each pair of identical numbers, draw a path that connects those two numbers. The paths must go through orthogonally adjacent cells. Cells marked with a cross must be visited by two different paths, which cross over each other at those cells. All other cells may be visited by at most one path, and may not be visited more than once by that path. (It is permissible for a cell to not be visited by any path.)

Reference: WPF (1)