In 2016 there was a discussion of what I call
Sudoshiki puzzles.
In the parlance that I suggested, the "clueless" puzzles mentioned above might be categorised as
SI(N = 9, G = 0, R = 144).
For 9x9 Sudoshiki, with no givens (G = 0), then fully-specified puzzles, that is, when all relationships are specified (R = 72 + 72 = 144), uniqueness of solution is not necessarily guaranteed.
And from
blue, we have this R = 19 puzzle, which has the lowest known R count:
- Code: Select all
------------<-----<<->---<------------------->-----<<----------->-----<-
>>-----------<---->--------<<<--->------------------------<-------------