Hejduko
Found on the last page of Log 67, Hejduko is a nine-square, two-part puzzle that subdivides a grid into nine orthogonally contiguous regions of equal area that do not overlap. Each of the grid’s rows, columns, and regions contain exactly one of every digit, 1 through 9. The shape and placement of each region can be drawn from the given restrictions. The puzzle has one valid solution.
Hints
Due to restrictions 1 and 4, the corridor in restriction 9 must occupy the bottom left cell.
Due to restriction 5, the corridor in restriction 9 cannot be the corridor in restriction 6.
Due to restriction 7, the non-two-digit region must contain a preprinted 5.
Due to restrictions 4 and 6, the 3x3 region contains a preprinted 2.