I hope the following may help.
daj95376 wrote:This unfinned Jellyfish is perfectly legal/acceptable even though it contains two Locked Candidate 1 subpatterns.
- Code: Select all
unfinned Jellyfish c1389\r1389
+-----------------------------------+
| X * X | * * * | * X X |
| / . / | . . . | . / / |
| X * X | * * * | * X X |
|-----------+-----------+-----------|
| / . / | . . . | . / / |
| / . / | . . . | . / / |
| / . / | . . . | . / / |
|-----------+-----------+-----------|
| / . / | . . . | . / / |
| X * X | * * * | * X X |
| X * X | * * * | * X X |
+-----------------------------------+
As X is a base candidate, which may be missing, this statement is only true iff the conditions that make it true or false are clearly and completely given. Further, we don't logically have the right to wave them off on account of the fact that they don't happen in a real valid puzzle, otherwise we could make false deductions with ambiguous almost fishes. Therefore, "this unfinned Jellyfish is perfectly legal/acceptable even though it contains two Locked Candidate 1 subpatterns,
except in the case of a combination of 2 competing skyscrapers", for example.
daj95376 wrote:How can we determine if a candidate grid is unable to support an overlayed unfinned fish pattern?
daj95376 wrote:When it comes to fish, I place them into four categories ... all derived from real puzzles:
1)...
2)...
3) A finned fish where at least one of the fins is true and the fish seems valid for the candidate.
4) A finned fish where at least one of the fins is true and the fish is not valid for the candidate.
Finding a way to distinguish (3) from (4) could be interesting.
By being aware of the possibility of an invalid situation from the very start.
daj95376 wrote:Are we going to allow the use of fish patterns where the cover set does not intersect the elimination cells? After all, we're now allowing remote/Kraken fin cells that don't directly see the elimination cells. Why does the fish pattern have to contain the elimination cells?
What are the cover sets? Truly, IMHO, they are strong sets that must be added to the base sets to take into account all the Sudoku puzzle rules that are necessary to justify an elimination from the given base sets. In the Fish Advanced Solving Technique, it is supposed that the number of cover sets is at least equal to the number of base sets. The excess in number of cover sets are then implicitly distributed among the fins. One hopes that what remains either is useless, implicitly correct, obvious, ... (?) or justifies a NoFish elimination due to a lack of taking into account additional box-line interaction(s). Therefore, the eliminated candidate is implicitly weakly linked to a derived strong set made either of the fins or of some elements of the base sets or of both. However, as there is room for some ambiguity, the question remains : what is effectively, in practice, for a fisherman, the cover sets?
JC