# Estimating the value of Pi using Monte Carlo

**Monte Carlo estimation**

Monte Carlo methods are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. One of the basic examples of getting started with the Monte Carlo algorithm is the estimation of Pi.

**Estimation of Pi**

The idea is to simulate random (x, y) points in a 2-D plane with domain as a square of side 1 unit. Imagine a circle inside the same domain with same diameter and inscribed into the square. We then calculate the ratio of number points that lied inside the circle and total number of generated points. Refer to the image below:

We know that area of the square is 1 unit sq while that of circle is . Now for a very large number of generated points,

that is,

The beauty of this algorithm is that we don’t need any graphics or simulation to display the generated points. We simply generate random (x, y) pairs and then check if . If yes, we increment the number of points that appears inside the circle. In randomized and simulation algorithms like Monte Carlo, the more the number of iterations, the more accurate the result is. Thus, the title is “**Estimating** the value of Pi” and not “Calculating the value of Pi”. Below is the algorithm for the method:

**The Algorithm**

1. Initialize circle_points, square_points and interval to 0.

2. Generate random point x.

3. Generate random point y.

4. Calculate d = x*x + y*y.

5. If d <= 1, increment circle_points.

6. Increment square_points.

7. Increment interval.

8. If increment < NO_OF_ITERATIONS, repeat from 2.

9. Calculate pi = 4*(circle_points/square_points).

10. Terminate.

The code doesn't wait for any input via stdin as the macro INTERVAL could be changed as per the required number of iterations. Number of iterations are the square of INTERVAL. Also, I've paused the screen for first 10 iterations with getch() and outputs are displayed for every iteration with format given below. You can change or delete them as per requirement.

x y circle_points square_points - pi

Examples:

INTERVAL = 5 Output : Final Estimation of Pi = 2.56 INTERVAL = 10 Output : Final Estimation of Pi = 3.24 INTERVAL = 100 Output : Final Estimation of Pi = 3.0916

`/* C++ program for estimation of Pi using Monte ` ` ` `Carlo Simulation */` `#include <bits/stdc++.h> ` ` ` `// Defines precision for x and y values. More the ` `// interval, more the number of significant digits ` `#define INTERVAL 10000 ` `using` `namespace` `std; ` ` ` `int` `main() ` `{ ` ` ` `int` `interval, i; ` ` ` `double` `rand_x, rand_y, origin_dist, pi; ` ` ` `int` `circle_points = 0, square_points = 0; ` ` ` ` ` `// Initializing rand() ` ` ` `srand` `(` `time` `(NULL)); ` ` ` ` ` `// Total Random numbers generated = possible x ` ` ` `// values * possible y values ` ` ` `for` `(i = 0; i < (INTERVAL * INTERVAL); i++) { ` ` ` ` ` `// Randomly generated x and y values ` ` ` `rand_x = ` `double` `(` `rand` `() % (INTERVAL + 1)) / INTERVAL; ` ` ` `rand_y = ` `double` `(` `rand` `() % (INTERVAL + 1)) / INTERVAL; ` ` ` ` ` `// Distance between (x, y) from the origin ` ` ` `origin_dist = rand_x * rand_x + rand_y * rand_y; ` ` ` ` ` `// Checking if (x, y) lies inside the define ` ` ` `// circle with R=1 ` ` ` `if` `(origin_dist <= 1) ` ` ` `circle_points++; ` ` ` ` ` `// Total number of points generated ` ` ` `square_points++; ` ` ` ` ` `// estimated pi after this iteration ` ` ` `pi = ` `double` `(4 * circle_points) / square_points; ` ` ` ` ` `// For visual understanding (Optional) ` ` ` `cout << rand_x << ` `" "` `<< rand_y << ` `" "` `<< circle_points ` ` ` `<< ` `" "` `<< square_points << ` `" - "` `<< pi << endl << endl; ` ` ` ` ` `// Pausing estimation for first 10 values (Optional) ` ` ` `if` `(i < 20) ` ` ` `getchar` `(); ` ` ` `} ` ` ` ` ` `// Final Estimated Value ` ` ` `cout << ` `"\nFinal Estimation of Pi = "` `<< pi; ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

Final Estimation of Pi = 3.16116

This article is contributed by **Paras Lehana**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Minimum change in given value so that it lies in all given Ranges
- Number of factors of very large number N modulo M where M is any prime number
- Maximum value of B less than A such that A ^ B = A + B
- Maximize the first element of the array such that average remains constant
- Find the type of triangle from the given sides
- Count of even and odd set bit with array element after XOR with K
- Check if given coins can be used to pay a value of S
- Check if N-factorial is divisible by X^Y
- Count numbers whose maximum sum of distinct digit-sum is less than or equals M
- Print all possible pair with prime XOR in the Array
- Find Next number having distinct digits from the given number N
- Check if it is possible to make x and y zero at same time with given operation
- Check if N can be expressed as product of 3 distinct numbers
- Find all Factors of Large Perfect Square Natural Number in O(sqrt(sqrt(N))