Difference between revisions of "Monte Carlo"
(→Monte Carlo Tree Search) |
(→Monte Carlo Tree Search) |
||
| Line 30: | Line 30: | ||
[http://www.google.com/search?q=Monte+Carlo+Tree+Search+Artificial ...Google search] | [http://www.google.com/search?q=Monte+Carlo+Tree+Search+Artificial ...Google search] | ||
| − | * [https://en.wikipedia.org/wiki/Monte_Carlo_tree_search Monte Carlo Tree Search | Wikipedia] | + | * [https://en.wikipedia.org/wiki/Monte_Carlo_tree_search Monte Carlo Tree Search (MCTS) | Wikipedia] |
* [http://mcts.ai/about/ Monte Carlo Tree Search (MCTS)] | * [http://mcts.ai/about/ Monte Carlo Tree Search (MCTS)] | ||
* [[Markov Decision Process (MDP)]] | * [[Markov Decision Process (MDP)]] | ||
Revision as of 20:52, 1 September 2019
- Model Free Reinforcement learning algorithms (Monte Carlo, SARSA, Q-learning) | Madhu Sanjeevi (Mady) - Medium
- Google DeepMind AlphaGo Zero
- An Introduction to Monte Carlo Techniques in Artificial Intelligence | Todd W. Neller
- Reinforcement Learning (RL)
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.
Monte Carlo Tree Search
Youtube search... ...Google search
- Monte Carlo Tree Search (MCTS) | Wikipedia
- Monte Carlo Tree Search (MCTS)
- Markov Decision Process (MDP)
Monte Carlo Simulation
Youtube search... ...Google search
