This was my first attempt at using the Hitlines constraints invented by Ratfinkz and Marty Sears.
Here you can solve the puzzle online:
Normal sudoku rules apply. Place the digits 1-9 once each in each row, column, and 3x3 region.
Full Rank: Every row and column creates two 9-digit numbers, one read left to right or top to bottom and one read right to left or bottom to top, for a total of thirty-six 9-digit numbers. These numbers are then ranked from smallest to largest, with the smallest being rank 1 and the largest rank 36. Digits outside the grid show the rank for the appropriate row or column reading from that end.
Kropki: Cells separated by a white dot contain consecutive digits.
All lines are both region sum lines and hit point lines.
Region Sum: The sum of digits on a line within a 3x3 region is the same for each instance of that line. The area outside the 9x9 grid is considered another single region for the purposes of this rule.
Hit Point Lines: Digits along a line do not repeat. The total of a line is equal to the total of any digits that equal their position number along that hit point line.
The hit point line total is the same as the region sum for each line.
The solver must determine at which end each line starts.
Different lines may have different totals.
Happy solving! Here you can solve the puzzle online:
Solution code: The digits on row 5 read from left to right (9 digits)
on 12. September 2026, 21:24 by ViKingPrime
Be careful, Full Rank is kind of a gateway constraint, next thing you know you're setting Fillominos and Flat Mates and all sorts of shady business.
on 12. September 2026, 21:19 by Flinty
Very nice! :)
on 11. September 2026, 02:03 by mnasti2
Impressive how much juice you got out of those clues!
on 10. September 2026, 23:54 by PrissyP
Lots of different things to keep track of at the same time which was very fun. Usually I am not the biggest fan of full rank puzzles but I did enjoy the logic with the constraint here.
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.