DEFISE wrote:here is only a summary of my resolution at depth 2, because my program does not output the exact syntax of whips (only right links):

1) I prove that (puzzle + hint 7L3C5) has no solution, using several whips[n], n <= 10.

2) I delete the candidate 7L3C5

3) I solve the puzzle using several whips[n], n <= 10.

OK, I can reproduce this with SudoRules, with the same max lengths.

As of now, it seems to be the simplest solution - n8r3c5 is a whip[10]-backdoor. But one may ask, why should you try precisely this candidate?