Show HN: Pi Approximation using Monte Carlo

Re:Show HN: Pi Approximation using Monte Carlo by jwmerrill on Sunday August 10, 2014 @02:36PM (#8160348)

I like computing the volume of the intersection of 3 orthogonal cylinders as a less trivial example problem. It's still easy to compute whether a given point is inside the volume, and there's still an analytic solution to compare to, but the problem is complicated enough that you start to appreciate how much easier MC is than other approaches.

[ Parent | on HN ]

Re:Show HN: Pi Approximation using Monte Carlo by jwmerrill on Sunday August 10, 2014 @02:45PM (#8160368)

Or compute the area of the mandlebrot set. This one has the advantage of being highly non-convex, which makes it hard to decide how to implement a recursive subdivision routine, since you don't know whether some of the target area is inside a given square just from looking at a few points on its boundary.

[ Parent | on HN ]

Re:Show HN: Pi Approximation using Monte Carlo by keithpeter on Monday August 11, 2014 @09:55AM (#8163235)

Mandlebrot set a bit over the maths level for intended group, but other repeated maps like logistic equation might be OK. I'll go with the cylinders first!

[ Parent | on HN ]

Re:Show HN: Pi Approximation using Monte Carlo by keithpeter on Monday August 11, 2014 @09:53AM (#8163228)

Sounds nice. Easy to visualise and close enough to a crucible design (toroidal volume intersected by a cube off axis and oblique to the central axis of the toroid) I once heard of in the days of Fortran.

[ Parent | on HN ]