Quoted from league of legends:
The probability of a critical strike changes dynamically based on how many times the attack critically strikes. If an attack does not critically strike over multiple attempts, the probability will progressively increase for future attempts—this can occur vice versa, where multiple successful critical strikes will cause the probability to progressively decrease for future attempts.
If I understand correctly, the chance for an event to appear is progressively affected by previous times, i.e. non-uniform distribution
randomization, right? Is there such a randomization algorithm in golang
's math/rand
? If not, how can we implement it?
Aucun commentaire:
Enregistrer un commentaire