Bendoku D 1
One being discussed on the players forum:
It is a renban groups puzzle, i.e. the group must contain consecutive numbers in any order.
Any gray (boundary) cell (which as I created the puzzle in JSudoku I am showing as a single cell cage) not on the edge creates four renban groups (above, below, left and right). So a grey cell at r4c4 creates the four renban groups r123c4, r56789c4, r4c123 and r4c56789. The grey cell has a value so for r4c4 it can be 1, 4, 6 or 9.
See http://forum.enjoysudoku.com/benoku-part-4-t36398.html for the puzzle creator's version of the rules.
Note that the gray cells have a value unlike Str8ts. When I create Str8ts I like at least one black cell to have different values horizontally and vertically.
See https://www.str8ts.com/Main_Page.html for puzzles which I enjoy.
The gray cell possibilities are limited r5c5 can be 159, r46c46 can be 1469, all others are 1 or 9.
I decided to play around with N5 given it has more possibilities.
This works well in JSudoku provided that you do not use the Renban Group facility which is faulty.
Solved without guesses but Udosuk would say I used too many elimination chains.
Note it is D/.
0 7 0 | 0 0 0 | 0 0 4
0 0 0 | 0 0 2 | 0 [] 0
0 0 [] | 0 0 0 | 0 0 0
-------------------------
0 0 0 | [] 0 0 | 0 0 0
0 0 0 | 0 0 0 | 0 0 0
0 0 0 | 0 0 [] | 0 0 0
-------------------------
0 0 0 | 0 0 0 | [] 0 0
3 0 0 | 0 0 0 | 0 0 0
0 0 0 | 0 0 0 | 0 6 0
Two blocking cells in a nonet is quite restricted. I'll try and see if 9 blocking cells can be done. I've managed to get to eight and I think nine might be possible but with my manual methods it is too much work to go through all cases.