Decision to not use short words as hidden words breaks the retry logic. Every run is now identical for word sets containing only short words. If it doesn't get it on the first try it fails completely.
Need to use different retry logic, e.g. permute the words within each length-class.
Decision to not use short words as hidden words breaks the retry logic. Every run is now identical for word sets containing only short words. If it doesn't get it on the first try it fails completely.
Need to use different retry logic, e.g. permute the words within each length-class.