11/19/2022 0 Comments Easy slay the spire seeds![]() This is simply the number of unsigned integers 2^64 = 18446744073709551616, since each seed is a 64-bit integer. Let C be the number of cards available, and D be the starting deck size, then the answer is (applying multiplication rule): P(same) = 1/22 * (1/C)^(D) Apply the inverse rule again to find the probability that at least one seed exists: P(one seed) = 1 - (1 - P(same)))^NĬorollary 1: The inverse 1 / P(same) is the amount of seeds you would have to try to find at least one success on average (expectation of geometric variable).Ĭorollary 2: By multiplying the probability P(same) with the number of seeds N and the number of cards C (each card is independent), you get the expected total number of perfect seeds.Īll cards need to be the exact same specific card. Thus the probability that no seed exists is (1 - P(same))^N. Custom also does this, regardless of whether you set the seed, so if you run it in Custom to play at an ascension level you havent unlocked yet, you will not unlock that level should you win. For this to happen N times, multiply itself by N by applying the Multiplication Rule N times. If you set a seed, all achievements and the ability to unlock additional levels of ascension are disable, I believe. The probability that all cards are not the same is 1 - P(same) by applying the Inverse Rule. Then, combine the two steps with the following proof: ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |