>>We compute a Monte Carlo approximation of π using importance sampling with shots coming out of a Mossberg 500 pump-action shotgun as the proposal distribution.
Re:Finding Pi from Random Numbers
by xucheng on Thursday December 27, 2018 @10:41AM
(#18770062)
There is another way to compute pi from random numbers while having nothing to do with geometry. The probability of two random numbers being co-prime is related to pi [1]. Notably, standupmaths did this once by hand [2].
Re:Finding Pi from Random Numbers
by nine_k on Thursday December 27, 2018 @02:30PM
(#18771849)
The article is not about the (trivial) way to compute pi by putting random numbers in the square. It's about altering the way you compute your target function to narrow down the confidence intervals, while still computing the same value.
Definitely you can compute pi by scanning a uniform grid in a square and checking how much ends up in the quarter-circle. But with these stats tricks applied, mere 10k points give the author very good approximation, beating 22/7 30% of the time. Scanning a 100x100 grid will give a much coarser approximation, I suppose.
https://arxiv.org/abs/1404.1499
> A Ballistic Monte Carlo Approximation of π
>>We compute a Monte Carlo approximation of π using importance sampling with shots coming out of a Mossberg 500 pump-action shotgun as the proposal distribution.
[1]: https://en.wikipedia.org/wiki/Coprime_integers#Probability_o...
[2]: https://youtu.be/RZBhSi_PwHU
Definitely you can compute pi by scanning a uniform grid in a square and checking how much ends up in the quarter-circle. But with these stats tricks applied, mere 10k points give the author very good approximation, beating 22/7 30% of the time. Scanning a 100x100 grid will give a much coarser approximation, I suppose.