# Buffon's Needle

Buffon’s Needle is a probability problem originially discussed in the 18th century. The problem revolves around needles of a given length and a floor marked with infinite parallel lines, each equidistant from each other. The goal is to determine the probability that a needle randomly thrown anywhere on the floor intersects one of those lines based upon the length of the needle and the distance between the lines on the floor. In this post, I derive the analytical solution of this probability and conduct a Monte Carlo simulation of Buffon’s needle problem in the Julia programming language.

I made two simplifying assumptions in this work. The first is that the length of the needle is less than the distance between the lines on the floor. This eliminates the possibility that the needle intersects two or more lines. The second assumption is that needles land on the floor at random positions and with random orientations.

## Representing the Needle and the Floor

The position and orientation of a needle thrown onto the floor can be described by the Cartesian coordinates $(x,y)$ of its center and the angle $\theta$ it makes with the veritcal. The floor can be described by the distance $\ell$ between successive parallel lines repeating ad infinitum in the $x$-direction.

Given two needles with an identical $x$ coordinate and angle $\theta$, we notice that their $y$ coordinates do not influence whether they intersect a line or not. Therefore, we do not need to consider it for our calculations; we only need to keep track of the $x$-coordinate and angle $\theta$ of a needle during the simulation.

The successive lines on the floor are a distance $\ell$ apart and repeat infinitely in the $x$-direction. The simulation needs to model a needle being dropped anywhere on this infinite floor, but it is impractical to create an infinite floor for the simulation. If we define two lines and the space between them as a chunk, we can see that the fraction of needles that intersect a line in each chunk is expected to be the same. Thus for our simulation, we can consider only a single chunk $0 \leq x \leq \ell$ and arrive at the answer to Buffon’s needle problem, which concerns an infinte floor.

It would make sense to allow the angle with vertical $0 \leq \theta \leq 2\pi$, however we can take advantage of some rotational symmetry. A needle with angle $\theta$ appears equivalent to a needle with the same coordinates and angle of $\theta + \pi$. We therefore only allow $0 \leq \theta \leq \pi$. For example, since $0 \leq \theta \leq \pi$ contains $\frac{\pi}{4}$ there is no need to test $\frac{5\pi}{4}$ because they would describe the same orientation of a needle.

#### The State Space of a Needle

The “state space” $R$ of a needle, and therefore the simulation box for our simulation is:

Randomly throwing a needle on the floor in our simulation is equivalent to drawing a uniformly distributed sample from the state space $R$.

#### Data Structure for a Needle

I created a `Needle`

struct in order to conveniently store all the relevant attributes of a needle in one data structure in Julia.

For the floor, I describe it by a single value `ℓ::Number`

, the distance between two successive lines.

## Simulation of Needle Throws

For the simulation, I created a `throw_needle`

function that generates a `Needle`

uniformly distributed in the state space given by the length of the needles $L$ and distance $\ell$ between the lines on the floor:

This function essentially “samples” the needle state space.

## Checking for Needles Intersecting a Line

A needle will intersect a line if part of the needle overlaps $x=0$ or $x=\ell$. We check for overlap by checking the $x$-coordintes of the endpoints of the needles. If one of those are outside the simulation box (one is less than $0$ or greater than $\ell$), then the needle intersects a line.

The $x$-coordinates of the two endpoints of a needle are found as follows. First, take the $x$-coordinate for the center of the needle. Then add or subtract half of the length of the projection of the needle onto the $x$-axis, $\frac{L}{2}\sin\theta$. This generates two conditions for whether or not a needle crosses a line. This is where the assumption that $L < \ell$ is important. It restricts each needle thrown in the simulation box to intersect the $x=0$ line, the $x=\ell$ line, or neither (but not both). A needle with coordinate $x$ and angle $\theta$ intersects a line if and only if:

The following function in Julia takes a `Needle`

as an argument and checks if it intersects a line on the floor:

## Calculating Probability Analytically

To analytically obtain the probability of a needle intersecting a line, we can look at the fraction of the state space that leads to a needle intersecting a line. Visually, we can graph the state space $R$ of the needle in the $(x,\theta)$ plane and shade the regions of state space that result in needles intersecting lines. These regions are described by $x+\frac{L}{2}\sin\theta>\ell$ and $x-\frac{L}{2}\sin\theta<0$. The total areas of these regions divided by the total area of the state space is then the probability of a needle intersecting a line.

The area of the total state space of the needle is:

The area of the state space satisfying $x-\frac{L}{2}\sin\theta\leq0$ is:

The area of the state space satifying $x+\frac{L}{2}\sin\theta\geq \ell$ is:

Therefore, the total area of needle state space that results in intersection with a line on the floor is:

and thus the probability of a needle landing on a line is:

## Calculating the Probability Through a Monte Carlo Simulation

To calculate Buffon’s needle probability with a Monte Carlo simulation, we will “throw” needles on the floor with our function `throw_needle`

, which draws uniformly random $x$ positions and uniformly random angles $\theta$ to decide the state of the thrown needle. This is effectively sampling a point from the needle state space $R$. We then keep track of the fraction of the needles that intersected a line as an estimate of Buffon’s needle probability. We expect the simulation to recover $2L/(\ell \pi)$.

I then plotted the randomly generated needles as points in their state space $R$. The needles that were found to intersect a line on the floor are colored with blue. Those that didn’t intersect a line are colored red. This visualization is valuable because, once we plot the data, the curves $x+\frac{L}{2}\sin\theta\geq \ell$ and $x-\frac{L}{2}\sin\theta\leq 0$ from the analytical approach are apparent.

When I ran the simulations, I would compare the theoretical probability $\frac{2L}{\ell\pi}$ with the probability calculated from the simulation. I chose $L=10$ for the length of the needle and $\ell=30$ as the distance between the lines on the floor. Using these numbers in the analytical solution, I expect a probability around 0.2122 (21.22%) for a needle to intersect with a line. The simulation generating the statespace graph above, comprised of 2500 needle throws, gave a simulated probability of about 0.2 (20.00%).

To check the accuracy of these results, I made another plot that showed the estimated probability– the fraction of needles that intersect a line in a simulation– as a function of the number of throws. This plot displays error bars describing the range of probabilities it got based on the standard deviation from multiple simulations with that number of throws. We expect that, as we use more needle throws to estimate the probability of intersecting a line, the estimate will become more accurate and errors will be smaller.

We see from this graph the number of needle throws in a Monte Carlo simulation required to obtain an estimate of Buffon’s needle probability with a given confidence.