Difference between revisions of "Magic Intuition:Probability"
From Olekdia Wiki
(Marked this version for translation) |
|||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | |||
<translate> | <translate> | ||
<!--T:1--> | <!--T:1--> | ||
Line 20: | Line 19: | ||
#:<tt><b>ζ<sub><small>n</small></sub> = n! / ((n / 2)! * (n / 2)!)</b></tt> - all possible card orders of this deck (permutations of n cards with repetitions). | #:<tt><b>ζ<sub><small>n</small></sub> = n! / ((n / 2)! * (n / 2)!)</b></tt> - all possible card orders of this deck (permutations of n cards with repetitions). | ||
</translate> | </translate> | ||
+ | |||
+ | <languages/> | ||
+ | {{DISPLAYTITLE:<span style="position:absolute; top:-9999px;">Magic Intuition:</span>Probability}} |
Latest revision as of 14:03, 25 September 2019
Probability is the measure of the likelihood of getting no less than certain amount of right answers out of total number of trials. It is quantified as a number between 0 and 1 (where 0 indicates impossibility and 1 indicates certainty). It is calculated in different ways for different types of games.
- For Forex, Dice, Soccer and Space games we use Bernoulli formula, as in each round probability to get the true answer doesn't depend on the previous rounds results:
- Pn(k) = Cnk * pk * qn-k;
- where p - probability to guess right in every single round.
- For example, for Forex it is 1/2, for Dice - 1/6, and Space - 1/2 (easy), 2/5 (medium), 1/3 (hard)
- q = 1 - p
- Probability to guess no less than k times in n rounds:
- Probability = Pn(n) + Pn(n-1) + … + Pn(k);
- For Sector game conditional probability rule is used. Here probability describes how likely is to reach the round k with t attempts for each round:
- Probability = t/ν1 * t/ν2 * … * t/νk;
- where νk - number of sectors in round k.
- For Color and Suit games we apply conditional probability rule together with the rule of the sum of probabilities. We assume that player chooses the most probable variant every round. Here probability shows how likely it is to guess correct no less than k times with n cards in the shuffled deck, using such strategy.
- Probability = p1/ζn + … + pt/ζn;
- where pt - probability to win within the certain order of cards (t) in the deck
- ζn = n! / ((n / 2)! * (n / 2)!) - all possible card orders of this deck (permutations of n cards with repetitions).
- Probability = p1/ζn + … + pt/ζn;