<HTML>What about a bit of good old Monte Carlo brute force ? You know, the probability of a grain of sand falling in the circle inscribed inside a square as opposed to outside the circle is theoretically Pi/4. By generating a lot of random x/y values and actually doing the operation, you can actually see the solution converge toward Pi/4. After a few millions trials, provided your random function is uniform, it'll keep converging and give you more and more correct decimals.
So an easy but processor intensive way to calculate Ishmael's geometric probability is to take the degree of error his correlation allows and use that as the grid for a random 3 dots generator/orion comparator function.
Ishmael: if you can provide me with the error the correlation allows, I can have a look at this
Francis.</HTML>
