Re: Monte Carlo approximation of PI

Indeed, well spotted. So to make the algorithm even slower, we might actually have to run it twice, once with < 1 and once with <= 1, and then take the average of the two. Oh well :).

CU
Robartes-

Comment on Re: Monte Carlo approximation of PI Select or Download Code

Replies are listed 'Best First'.
Re: Monte Carlo approximation of PI by Abigail-II (Bishop) on Apr 04, 2003 at 14:11 UTC
I just ran a simulation with 16 million uniformely distributed points, and using both `< 1` and `<= 1` give estimates of `3.141020`. Round-off errors probably pay their toll as well, even on my 64bit perl. Abigail	[reply] [d/l] [select]
Re: Re: Monte Carlo approximation of PI by robartes (Priest) on Apr 04, 2003 at 14:16 UTC
OK. Let's file the < vs <= issue under 'premature (or even unnecessary) optimization' then (although not optimization in the speed sense :) ). CU Robartes-	[reply]