SICP Exercise 3.5
Question
Monte Carlo integration is a method of estimating definite integrals by means of Monte Carlo simulation. Consider computing the area of a region of space described by a predicate \(P(x,y)\) that is true for points \((x,y)\) in the region and false for points not in the region. For example, the region contained within a circle of radius 3 centred at \((5,7)\) is described by the predicate that tests whether \((x-5)^2+(y-7)^2\le 3^2\) . To estimate the area of the region described by such a predicate, begin by choosing a rectangle that contains the region. For example, a rectangle with diagonally opposite corners at \((2,4)\) and \((8,10)\) contains the circle above. The desired integral is the area of that portion of the rectangle that lies in the region. We can estimate the integral by picking, at random, points \((x,y)\) that lie in the rectangle, and testing \(P(x,y)\) for each point to determine whether the point lies in the region. If we try this with many points, then the fraction of points that fall in the region should give an estimate of the proportion of the rectangle that lies in the region. Hence, multiplying this fraction by the area of the entire rectangle should produce an estimate of the integral.
Implement Monte Carlo integration as a procedure estimate-integral
that takes
as arguments a predicate P
, upper and lower bounds x1
, x2
, y1
, and y2
for the rectangle, and the number of trials to perform in order to produce the
estimate. Your procedure should use the same monte-carlo
procedure that was
used above to estimate \(\pi\). Use your estimate-integral
to produce an estimate
of \(\pi\) by measuring the area of a unit circle.
You will find it useful to have a procedure that returns a number chosen at
random from a given range. The following random-in-range
procedure implements
this in terms of the random procedure used in 1.2.6, which returns a non-negative
number less than its input.
(define (random-in-range low high)
(let ((range (- high low)))
(+ low (random range))))
Answer
Here’s my solution:
(define (experiment x1 x2 y1 y2 radius)
(<= (+
(square (random-in-range x1 x2))
(square (random-in-range y1 y2)))
radius))
(define (estimate-integral x1 x2 y1 y2 trials)
(define rect_area (* (- x2 x1) (- y2 y1)))
(* rect_area (monte-carlo
trials
(λ () (experiment x1 x2 y1 y2 1.0)))))
Let’s run it 100,000 times:
(estimate-integral -1.0 1.0 -1.0 1.0 100000)
Result is quite close to \(\pi\), accuracy can be improved by increasing trials
:
3.14948