# 10.1: Buffon's Problems

- Page ID
- 10222

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\id}{\mathrm{id}}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\kernel}{\mathrm{null}\,}\)

\( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\)

\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\)

\( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)

\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)

\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vectorC}[1]{\textbf{#1}} \)

\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)Buffon's experiments are very old and famous random experiments, named after comte de Buffon. These experiments are considered to be among the first problems in geometric probability.

## Buffon's Coin Experiment

Buffon's coin experiment consists of dropping a coin randomly on a floor covered with identically shaped tiles. The event of interest is that the coin crosses a crack between tiles. We will model Buffon's coin problem with square tiles of side length 1—assuming the side length is 1 is equivalent to taking the side length as the unit of measurement.

### Assumptions

First, let us define the experiment mathematically. As usual, we will idealize the physical objects by assuming that the coin is a perfect circle with radius \(r\) and that the cracks between tiles are line segments. A natural way to describe the outcome of the experiment is to record the center of the coin relative to the center of the tile where the coin happens to fall. More precisely, we will construct coordinate axes so that the tile where the coin falls occupies the square \( S = \left[ -\frac{1}{2}, \frac{1}{2} \right]^2 \).

Now when the coin is tossed, we will denote the center of the coin by \((X, Y) \in S\) so that \(S\) is our sample space and \(X\) and \(Y\) are our basic random variables. Finally, we will assume that \(r \lt \frac{1}{2}\) so that it is at least possible for the coin to fall inside the square without touching a crack.

Next, we need to define an appropriate probability measure that describes our basic random vector \((X, Y)\). If the coin falls randomly

on the floor, then it is natural to assume that \((X, Y)\) is uniformly distributed on \(S\). By definition, this means that

\[ \P[(X, Y) \in A] = \frac{\area(A)}{\area(S)}, \quad A \subseteq S \]

Run Buffon's coin experiment with the default settings. Watch how the points seem to fill the sample space \(S\) in a uniform manner.

### The Probability of a Crack Crossing

Our interest is in the probability of the event \(C\) that the coin crosses a crack.

The probability of a crack crossing is \(\P(C) - 1 - (1 - 2 r)^2\).

## Proof

In Buffon's coin experiment, change the radius with the scroll bar and watch how the events \(C\) and \(C^c\) and change. Run the experiment with various values of \(r\) and compare the physical experiment with the points in the scatterplot. Compare the relative frequency of \(C\) to the probability of \(C\).

The convergence of the relative frequency of an event (as the experiment is repeated) to the probability of the event is a special case of the law of large numbers.

Solve Buffon's coin problem with rectangular tiles that have height \(h\) and width \(w\).

## Answer

\[1 - \frac{(h - 2 \, r)(w - 2 \, r)}{h \, w}, \quad r \lt \min \left\{ \frac{h}{2}, \frac{w}{2} \right\}\]

Solve Buffon's coin problem with equilateral triangular tiles that have side length 1.

Recall that random numbers are simulation of independent random variables, each with the standard uniform distribution, that is, the continuous uniform distribution on the interval \( (0, 1) \).

Show how to simulate the center of the coin \((X, Y)\) in Buffon's coin experiment using random numbers.

## Answer

\(X = U - \frac{1}{2}\), \(Y = V - \frac{1}{2}\), where \(U\) and \(V\) are random numbers.

## Buffon's Needle Problem

Buffon's needle experiment consists of dropping a needle on a hardwood floor. The main event of interest is that the needle crosses a crack between floorboards. Strangely enough, the probability of this event leads to a statistical estimate of the number \(\pi\)!

### Assumptions

Our first step is to define the experiment mathematically. Again we idealize the physical objects by assuming that the floorboards are uniform and that each has width 1. We will also assume that the needle has length \(L \lt 1\) so that the needle cannot cross more than one crack. Finally, we assume that the cracks between the floorboards and the needle are line segments.

When the needle is dropped, we want to record its orientation relative to the floorboard cracks. One way to do this is to record the angle \(X\) that the top half of the needle makes with the line through the center of the needle, parallel to the floorboards, and the distance \(Y\) from the center of the needle to the bottom crack. These will be the basic random variables of our experiment, and thus the sample space of the experiment is \[ S = [0, \pi) \times [0, 1) = \{(x, y): 0 \le x \lt \pi, \; 0 \le y \lt 1\} \]

Again, our main modeling assumption is that the needle is tossed randomly

on the floor. Thus, a reasonable mathematical assumption might be that the basic random vector \((X, Y)\) is uniformly distributed over the sample space. By definition, this means that \[ \P[(X, Y) \in A] = \frac{\area(A)}{\area(S)}, \quad A \subseteq S \]

Run Buffon's needle experiment with the default settings and watch the outcomes being plotted in the sample space. Note how the points in the scatterplot seem to fill the sample space \(S\) in a uniform way.

### The Probability of a Crack Crossing

Our main interest is in the event \(C\) that the needle crosses a crack between the floorboards.

The event \(C\) can be written in terms of the basic angle and distance variables as follows: \[ C = \left\{ Y \lt \frac{L}{2} \, \sin(X) \right\} \cup \left\{ Y \gt 1 - \frac{L}{2} \, \sin(X) \right\} \]

The curves \(y = \frac{L}{2} \, \sin(x)\) and \(y = 1 - \frac{L}{2} \, \sin(x)\) on the interval \(0 \le x \lt \pi\) are shown in blue in the scatterplot of Buffon's needle experiment, and hence event \(C\) is the union of the regions below the lower curve and above the upper curve. Thus, the needle crosses a crack precisely when a point falls in this region.

The probability of a crack crossing is \(\P(C) = 2 L / \pi\).

## Proof

In the Buffon's needle experiment, vary the needle length \(L\) with the scroll bar and watch how the event \(C\) changes. Run the experiment with various values of \(L\) and compare the physical experiment with the points in the scatterplot. Compare the relative frequency of \(C\) to the probability of \(C\).

The convergence of the relative frequency of an event (as the experiment is repeated) to the probability of the event is a special case of the law of large numbers.

Find the probabilities of the following events in Buffon's needle experiment. In each case, sketch the event as a subset of the sample space.

- \(\{0 \lt X \lt \pi / 2, \; 0 \lt Y \lt 1 / 3\}\)
- \(\{1 / 4 \lt Y \lt 2 / 3\}\)
- \(\{X \lt Y\}\)
- \(\{X + Y \lt 2\}\)

## Answer

- \(\frac{1}{6}\)
- \(\frac{5}{12}\)
- \(\frac{1}{2 \pi}\)
- \(\frac{3}{2 \pi}\)

### The Estimate of \( \pi \)

Suppose that we run Buffon's needle experiment a large number of times. By the law of large numbers, the *proportion* of crack crossings should be about the same as the *probability* of a crack crossing. More precisely, we will denote the number of crack crossings in the first \(n\) runs by \(N_n\). Note that \(N_n\) is a random variable for the compound experiment that consists of \(n\) replications of the basic needle experiment. Thus, if \(n\) is large, we should have \( \frac{N_n}{n} \approx \frac{2 L}{\pi} \) and hence \[ \pi \approx \frac{2 L n}{N_n} \] This is Buffon's famous estimate of \(\pi\). In the simulation of Buffon's needle experiment, this estimate is computed on each run and shown numerically in the second table and visually in a graph.

Run the Buffon's needle experiment with needle lengths \(L \in \{0.3, 0.5, 0.7, 1\}\). In each case, watch the estimate of \(\pi\) as the simulation runs.

Let us analyze the estimation problem more carefully. On each run \(j\) we have an indicator variable \(I_j\), where \(I_j = 1\) if the needle crosses a crack on run \(j\) and \(I_j = 0\) if the needle does not cross a crack on run \(j\). These indicator variables are independent, and identically distributed, since we are assuming independent replications of the experiment. Thus, the sequence forms a Bernoulli trials process.

The number of crack crossings in the first \(n\) runs of the experiment is \[ N_n = \sum_{j=1}^n I_j \] which has the binomial distribution with parameters \(n\) and \(2 L / \pi\).

The mean and variance of \(N_n\) are

- \(\E(N_n) = n \frac{2 L}{\pi}\)
- \(\var(N_n) = n \frac{2 L}{\pi} \left(1 - \frac{2 L}{\pi}\right)\)

With probability 1, \(\frac{N_n}{2 L n} \to \frac{1}{\pi}\) as \(n \to \infty\) and \(\frac{2 L n}{N_n} \to \pi\) as \(n \to \infty\).

## Proof

aThese results follow from the strong law of large numbers.

Thus, we have two basic estimators: \(\frac{N_n}{2 L n}\) as an estimator of \(\frac{1}{\pi}\) and \(\frac{2 L n}{N_n}\) as an estimator of \(\pi\). The estimator of \(\frac{1}{\pi}\) has several important statistical properties. First, it is *unbiased* since the expected value of the estimator is the parameter being estimated:

The estimator of \(\frac{1}{\pi}\) is unbiased: \[ \E \left( \frac{N_n}{2 L n} \right) = \frac{1}{\pi} \]

## Proof

This follows from the results above for the binomial distribution and properties of expected value.

Since this estimator is unbiased, the variance gives the mean square error: \[ \var \left( \frac{N_n}{2 L n} \right) = \E \left[ \left( \frac{N_n}{2 L n} - \frac{1}{\pi} \right)^2 \right] \]

The mean square error of the estimator of \( \frac{1}{\pi} \) is \[ \var \left( \frac{N_n}{2 L n} \right) = \frac{\pi - 2 L}{2 L n \pi^2} \]

The variance is a decreasing function of the needle length \(L\).

Thus, the estimator of \(\frac{1}{\pi}\) improves as the needle length increases. On the other hand, the estimator of \(\pi\) is biased; it tends to overestimate \(\pi\):

The estimator of \(\pi\) is positively biased: \[ \E \left( \frac{2 L n}{N_n} \right) \ge \pi \]

## Proof

Use Jensen's inequality.

The estimator of \(\pi\) also tends to improve as the needle length increases. This is not easy to see mathematically. However, you can see it empirically.

In the Buffon's needle experiment, run the simulation 5000 times each with \(L = 0.3\), \(L = 0.5\), \(L = 0.7\), and \(L = 0.9\). Note how well the estimator seems to work in each case.

Finally, we should note that as a practical matter, Buffon's needle experiment is not a very efficient method of approximating \(\pi\). According to Richard Durrett, to estimate \(\pi\) to four decimal places with \(L = \frac{1}{2}\) would require about 100 million tosses!

Run the Buffon's needle experiment until the estimates of \(\pi\) seem to be consistently correct to two decimal places. Note the number of runs required. Try this for needle lengths \(L = 0.3\), \(L = 0.5\), \(L = 0.7\), and \(L = 0.9\) and compare the results.

Show how to simulate the angle \(X\) and distance \(Y\) in Buffon's needle experiment using random numbers.

## Answer

\(X = \pi U\), \(Y = V\), where \(U\) and \(V\) are random numbers.

### Notes

Buffon's needle problem is essentially solved by Monte-Carlo integration. In general, Monte-Carlo methods use statistical sampling to approximate the solutions of problems that are difficult to solve analytically. The modern theory of Monte-Carlo methods began with Stanislaw Ulam, who used the methods on problems associated with the development of the hydrogen bomb.

The original needle problem has been extended in many ways, starting with Simon Laplace who considered a floor with rectangular tiles. Indeed, variations on the problem are active research problems even today.

Neil Weiss has pointed out that our computer simulation of Buffon's needle experiment is *circular*, in the sense the program assumes knowledge of \(\pi\) (you can see this from the simulation result above).

Try to write a computer algorithm for Buffon's needle problem, without assuming the value of \(\pi\) or any other transcendental numbers.