Title: Math behind crash game multiplier generation Post by: GrahamMopar on August 14, 2019, 06:12:29 PM Code:
Ignore all the hash related code, all it does is generate h such that h is uniform in [ 0 , 2^52 - 1] e is 2^52 How would I find the expected value from this algorithm? What is the probability density function? How would I change the house edge? Is it only " if (divisible(hash, 101)) return 0;" that gives the house an advantage? Initially I thought it would be exponentially distributed but it's not When doing simulations it seems that the edge is around 2% but even when removing the divisible by 101 code, the edge is around 1% and I don't understand where it comes from Can somebody provide a deeper math insight in this? How did they come up with this way of generating crash points? |