[Question][HW1] About Substitution Crack

[hbin0701]

Name: Hyeonbin Hwang

Dear Professor and TAs,
It is given as:

./substitution crack test/substitution1-cipher.txt
icoorclissdntaemdsaogsaosteldntaerebdlsseituohtfonerecheesinrtadhteenydnwtesnohtaeistinrmfnohtayidnmhinpasebentaldymeistsdresaootuhoytaeleutefeoutaereitasaeirimeeldneuhoytaetheetahowcataesaotudutfueetowttaecolrmwcmfercihillingoeelsdeghegihetoyeettafcortaeirbentwheoutaerinpdncyenmfihtawhponinrofle

but at the same time,

We do not provide test/substitution*-crack.expected files because the sim score can vary depending on your implementation.

Does the last sentence imply that the result does not necessarily have to be as given above? (and thus we have freedom to implement our own version of crack?)

Following simple heuristic, it seems like that crack will inevitably result as above and thus there is only one possible "rule" for implementation. if that's the case, why is test/substitution*-crack not provided?

Thanks in advance!

[hbin0701]

Never mind just realized, that for letters that have same statistics (or occurrences) , it will produce different results.