champagne, thanks for your response. It's clear there have been translation issues though.
To summarise things as I now see them: you ran a file of 11454 having the Exocet pattern against the new search routine
After correcting one line of your code you found 5 of them were rejected.
We then found the condition 3 had omitted the case when a base digit was restricted to two cross-lines.
When that was corrected 4 of the 5 were accepted but one was still rejected.
Which one was that? I may be wrong but they all seem acceptable to me!
What I didn't know was that when that list of 11454 was produced the check for target cells allowed them to see each other, but you never found one case where they did.
I believe that answers my question
<here> when I asked if you had ever found one as I thought they were probably impossible. (From Braid Analysis which looks at the patterns of repeating pairs in the mini-lines a band.)
My conjecture therefore is probably true, and maybe we can drop the case where the two targets see each other.
This encourages me to look for a proof of that.
Now are all one-band Exocets also JExocets? I think the answer is yes provided they produce exclusions!
I've seen quite a few puzzles where there are two Exocet matches for the 4 base and target cells, but only one provides exclusions. Each time that is the one that complies with condition 3.
Example: .2.45....4....92....6.2............83...9.5...7...3.1.5..9..3...8......6..1....7.;66;elev;24;2BN F1F3
In the past you've reported cases where the you found Exocet exclusions with split target cells. But these could not have been in your file of 11454 puzzles!
So there are 3 types of Exocet: 1:One-band Exocets, 2:Split Exocets, and 3:JExocets
Perhaps it's time to consider which one of these is the default case and which one(s) need additional descriptions.
Please correct me if I've got any of this wrong.
I'm sure there are still points I've missed and will have to come back to later, but at the moment these seem to be the important ones.