I have managed to produce a minimal form of "JSB", it has only 43 clues. The minimal form that I found is shown below.
I can't verify it just yet - creint has an experimental solver that might be able to help with this.
But meanwhile I thought it would be useful to know whether Hajime's SSSS could make this verification process a little easier by identifying additional candidate eliminations that we can make use of.
And indeed it does! Only a few are available, but every little bit helps. One cell is solved, and four candidate-eliminations are reported, I just need to know how to interpret this log:
- Code: Select all
A B C D E F G
1 1 1 1 1 9 row
1 2 1 1 6 3 box
1 3 1 2 7 5 JS
1 4 4 8 1 9 col
MinPuzzleDef: Show
MinPuzzleGrid: Show
Cheers,
MM