You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Could you please explain how removeCandidatesFromMultipleCells works?
//-1 because candidate '1' is at index 0 etc.
if (candidate && cellCandidates[candidate - 1] !== null) {
cellCandidates[candidate - 1] = null; //NOTE: also deletes them from board variable
As far as I understand: the cellCandidates is an array of candidates and the candidate index has nothing to do with its value. So cellCandidates[candidate - 1] !== null looks confusing.
It must be something like cellCandidates.contains(candidate). But it breaks several "solve method" tests. I'm totally confused.
Hey, thank you for the project, it implements many human strategies and is very handy for learning and defining difficulties.
I'm just curious about the commented code, mostly dealing with different strategies. Why? What's wrong with them?
I also heard about several more advanced strategies (XWing, Swordfish, Jellyfish, XYWing, XYZWing). What about them?
Thank you
The text was updated successfully, but these errors were encountered: