Logic Masters Deutschland e.V.

This is a fixed version of a puzzle originally posted two days ago. A million thanks to Davos and TrippleABattery for pointing out the flaw of the first version!

Standard Sudoku rules: place the digits 1-9 once in every row, column and 3×3 box.

Draw a serpent in the grid. The serpent is a single unbranching line starting in one of the 3×3 boxes and passing through each box exactly once before stopping in the final box; the exact order in which the serpent visits these boxes is to be determined by the solver. The serpent only moves orthogonally (left, right, up, down) and cannot visit a single cell multiple times.

The boxes are numbered in a standard reading order. In each box number N, the serpent occupies exactly N cells. Those cells contain a consecutive set of digits 1 through N in any order. E.g.: In the middle row of boxes, the leftmost box is number 4. The serpent occupies 4 cells in this box and they contain the digits 1-4.

Cells separated by a white dot contain consecutive digits; the serpent cannot pass through any white dots. Cells that are a chess knight's move apart cannot contain the same digit unless both of them are inside the serpent.

Click HERE to solve in SudokuPad (with the correct solution uploaded)