Because there are so many potential solutions it can be hard to determine if your solver is searching the entire space. I have started searching for every solution in the example puzzle to determine that changes aren't breaking completeness. Lacking any proof, the rule of thumb is 86 unique solutions for the example puzzle. If anyone else tries this trick, I'd appreciate if you could post your number of unique solutions - just to see if we can agree on that :)
For more complete information about compiler optimizations, see our Optimization Notice.