Monte-Carlo Pi

[Andres]

The very simple and old one I remember starts with generating two uniformly distributed numbers from the interval [0 1]. After invoking R -> P conversion, the X register contains the module of a vector which rectangular coordinates are the abovementioned random numbers.

If the module of the vector is less than 1, a counter is incremented. The ratio between this counter and the number of iterations should converge to pi/4.

From memory, it appeared on the TI-56 manual, IIRC.

I apologize in advance for any error in this post, which I am writing just from very old memories and with little time to recheck details.

(01-11-2022 11:37 AM)Ángel Martin Wrote:  I'm putting together a (very humble) RANDOM ROM with a (biased) selection of RNG-related programs and MCODE functions. I'd like to include a Monte-Carlo based calculation of pi, which I *think* has already been published in the forum but can't locate anymore. Any pointers to that reference will be appreciated...

Cheers,
ÁM