1,274
edits
Talk:Stat: Difference between revisions
→Regarding calculation of successful hit in battle: Is "probably uniform" not good enough?
(→Regarding calculation of successful hit in battle: Is "probably uniform" not good enough?) |
|||
| Line 118: | Line 118: | ||
"If P is greater than 1, the move will surely hit." But what if P isn't greater than 1? Surely it won't always miss... does anybody know anything about the formula that determines successful move hits? [[User:Hexagon Theory|Hexagon Theory]] 21:27, 10 November 2010 (UTC) | "If P is greater than 1, the move will surely hit." But what if P isn't greater than 1? Surely it won't always miss... does anybody know anything about the formula that determines successful move hits? [[User:Hexagon Theory|Hexagon Theory]] 21:27, 10 November 2010 (UTC) | ||
:P is just the probability that the move will hit. Probabilities greater than 1 don't make any sense, so it's explicitly stated that they're the same as 1 (i.e., always hit). Once the probability is calculated, the game (in effect) generates a random number between 0 and 1; if P is greater than or equal to this number, the attack hits. --[[User:Minimiscience|Minimiscience]] 16:10, 11 November 2010 (UTC) | :P is just the probability that the move will hit. Probabilities greater than 1 don't make any sense, so it's explicitly stated that they're the same as 1 (i.e., always hit). Once the probability is calculated, the game (in effect) generates a random number between 0 and 1; if P is greater than or equal to this number, the attack hits. --[[User:Minimiscience|Minimiscience]] 16:10, 11 November 2010 (UTC) | ||
::D'you know for certain that the random number is uniformly distributed? | ::D'you know for certain that the random number is uniformly distributed?{{unsigned|Hexagon Theory}} | ||
:::Technically, no, I don't know that, though I would expect it to be (or, at least, as close to uniform as pseudo-randomness can get you). --[[User:Minimiscience|Minimiscience]] 19:49, 11 November 2010 (UTC) | |||