Difference between revisions of "Monte Carlo"
| Line 7: | Line 7: | ||
A broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. Their essential idea is using randomness to solve problems that might be deterministic in principle. They are often used in physical and mathematical problems and are most useful when it is difficult or impossible to use other approaches. Monte Carlo methods are mainly used in three problem classes:[1] optimization, numerical integration, and generating draws from a probability distribution. | A broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. Their essential idea is using randomness to solve problems that might be deterministic in principle. They are often used in physical and mathematical problems and are most useful when it is difficult or impossible to use other approaches. Monte Carlo methods are mainly used in three problem classes:[1] optimization, numerical integration, and generating draws from a probability distribution. | ||
| − | http:// | + | http://cdn-images-1.medium.com/max/1349/1*ioDQJWtRffT7LlIiwwOHXw.jpeg |
<youtube>3gcLRU24-w0</youtube> | <youtube>3gcLRU24-w0</youtube> | ||
<youtube>kYWw6GBRjVk</youtube> | <youtube>kYWw6GBRjVk</youtube> | ||
Revision as of 10:19, 24 September 2018
- Google DeepMind AlphaGo Zero
- An Introduction to Monte Carlo Techniques in Artificial Intelligence | Todd W. Neller
- Monte Carlo Tree Search (MCTS)
A broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. Their essential idea is using randomness to solve problems that might be deterministic in principle. They are often used in physical and mathematical problems and are most useful when it is difficult or impossible to use other approaches. Monte Carlo methods are mainly used in three problem classes:[1] optimization, numerical integration, and generating draws from a probability distribution.
