Approximating Pi by the Monte Carlo Method
This Demonstration approximates using the Monte Carlo method: (1) randomly select points in a square with an inscribed circle; (2) multiply the number of points inside the circle by four; (3) divide by the total number of points in the square.
Contributed by:
Zubeyir Cinkir
X
X
X
Show Source Code
|
Download Source Code Notebook
Monte Carlo Method
(
Wolfram
MathWorld
)
"
Approximating Pi by the Monte Carlo Method
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/ApproximatingPiByTheMonteCarloMethod/
Contributed by:
Zubeyir Cinkir
Algorithms
Approximation Methods
Computer Science
Computers
Discrete Mathematics
Random Processes
Monte Carlo Estimate for Pi
Markov Chain Monte Carlo Simulation Using the Metropolis Algorithm
Linear Congruential Sequences
Digit-Reversal Sequences
Optimal Bin Packing with Random Lengths
Learning Newton's Method
Monte Carlo Methods to Estimate Area
Least Squares Estimate Using a Monte Carlo Method
B-Spline Curve with Knots
Grover's Quantum Search Algorithm
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
