For this to happen N times, multiply itself by N by applying the Multiplication Rule N times. 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: Figure out what the probability is that all cards are the same and the relic is pandora, denoted P(same).That means the seed searching program must have searched a substantial fraction (1% or so) of the total seed space to find all the perfect seeds it found, showing the power of a GPU (and why 64 or even 80 bit keys are now insecure in crypto) Reasoning | Character | Perfect chance | Number of seeds | Trials |

The following table details the chance there is at least one seed, the expected amount of them that exist, and the number of seeds you would have to try to find one by pure chance: +-+-+-+-+ The cause is the fact that adding one more card to the starting deck makes it 71 or 72 times less likely for a seed to succeed.įor the Silent, there's about a 22.7% chance any specific card has a perfect seed. (In fact, I believe the algorithm has already found most of the Defect and Watcher seeds, and has found a few of the Ironclad ones). For the Ironclad, Defect, and Watcher one very likely exists for every card.

Slay the spire seeds defect