Here is a sudoku, but with additional special rule.
The highlighted cells(which are gray) should have distinct number, from 1 to 9.
Could be quite hard… ;)
Using only singles and the fact that the shaded cells must be all distinct gets us this far – all 5s and 6s placed:
There must be a 2 in r6c12. This points into box 6 and shows r4c9 = 2. The same reasoning shows that 4 is in r56c6 and hence in r2c4, which eventually allows putting 9 in r2c8 and from there all 9s and 7s:
![]()
r5c7 can only be 3 or 4. If it is 3, r5c9 is 4, r6c8 8 and r8c3 8. If 4, r8c3 can only be 8. We thus fill in r8c3 = 8, and no matter how the last two shaded cells are filled, r6c8 = 8. We thus solve all 8s.
The rest is easy once you realise that 4 cannot go into r8c7.
Here’s my approach:
I think my first steps are similar to Parcly Taxel’s answer. I figured out all the 5’s, 6’s, 7’s, and 9’s and a bunch of other cells and got the following grid
At this point, there are two options for 3 in the gray cells: bottom right or middle right. I tried the bottom right first and it soon led to inconsistency: there’s no way to place a 2 in the bottom right 3×3 square.
So that means there’s a 3 in the middle right gray cell. The rest was again straightforward.