Answers.Body: <p>They are all called Monte Carlo because all of them are a different version of the canonical Monte Carlo algorithm.</p>
  
  <p>The canonical version of Monte Carlo algorithm is a stochastic algorithm to determine an action based in a tree representation. The differences among all these version are their exploration and exploitation mechanisms, and it is necessary to analyse each of them to define which one fits in your case. </p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2016-08-23T17:28:12.040Z
Answers.LastActivityDate: 2016-08-24T13:15:48.023Z
Answers.LastEditDate: 2016-08-24T13:15:48.023Z
Answers.UserDisplayName: Pedro Narloch
Body: <p>I'm a bit confused with extensive number of different <a href="https://en.wikipedia.org/wiki/Monte_Carlo_method" rel="noreferrer">Monte Carlo methods</a> such as:</p>
  
  <ul>
  <li><a href="https://en.wikipedia.org/wiki/Hybrid_Monte_Carlo" rel="noreferrer">Hamiltonian/Hybrid Monte Carlo (HMC)</a>,</li>
  <li><a href="https://en.wikipedia.org/wiki/Dynamic_Monte_Carlo_method" rel="noreferrer">Dynamic Monte Carlo (DMC)</a>,</li>
  <li><a href="https://en.wikipedia.org/wiki/Markov_chain_Monte_Carlo" rel="noreferrer">Markov chain Monte Carlo (MCMC)</a>,</li>
  <li><a href="https://en.wikipedia.org/wiki/Kinetic_Monte_Carlo" rel="noreferrer">Kinetic Monte Carlo (KMC)</a>,</li>
  <li><a href="https://en.wikipedia.org/wiki/Dynamic_Monte_Carlo_method" rel="noreferrer">Dynamic Monte Carlo (DMC)</a></li>
  <li><a href="https://en.wikipedia.org/wiki/Quasi-Monte_Carlo_method" rel="noreferrer">Quasi-Monte Carlo (QMC)</a>,</li>
  <li><a href="https://en.wikipedia.org/wiki/Direct_simulation_Monte_Carlo" rel="noreferrer">Direct Simulation Monte Carlo (DSMC)</a>,</li>
  <li>and so on.</li>
  </ul>
  
  <p>I won't ask for the exact differences, but why are all of them called Monte Carlo? What do they all have in common? Can they all be used for AI? E.g. which one can be used for gaming (like Go) or image recognition (resampling)?</p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2016-08-24T01:42:11.953Z
Comments.Text: I found [this paper](http://www.cameronius.com/cv/mcts-survey-master.pdf) which looks pretty comprehensive, and they touch on Go on p.27. However, that part is outdated since [AlphaGo](https://gogameguru.com/i/2016/03/deepmind-mastering-go.pdf).
  
  You might want to look at [Matthew Lai's Giraffe Chess](https://arxiv.org/pdf/1509.01549v2.pdf) paper. Similar method, but a less complex game.
Comments.UserDisplayName: DukeZhou
Tags: <gaming><comparison><monte-carlo-tree-search>
Title: How do I know when to use which Monte Carlo method?
UserDisplayName: kenorb
ThreadText: # How do I know when to use which Monte Carlo method?
  
  (Asked by: username_0 on 2016-08-11)
  
  I'm a bit confused with extensive number of different [Monte Carlo methods](https://en.wikipedia.org/wiki/Monte_Carlo_method) such as:
  
  * [Hamiltonian/Hybrid Monte Carlo (HMC)](https://en.wikipedia.org/wiki/Hybrid_Monte_Carlo),
  * [Dynamic Monte Carlo (DMC)](https://en.wikipedia.org/wiki/Dynamic_Monte_Carlo_method),
  * [Markov chain Monte Carlo (MCMC)](https://en.wikipedia.org/wiki/Markov_chain_Monte_Carlo),
  * [Kinetic Monte Carlo (KMC)](https://en.wikipedia.org/wiki/Kinetic_Monte_Carlo),
  * [Dynamic Monte Carlo (DMC)](https://en.wikipedia.org/wiki/Dynamic_Monte_Carlo_method)
  * [Quasi-Monte Carlo (QMC)](https://en.wikipedia.org/wiki/Quasi-Monte_Carlo_method),
  * [Direct Simulation Monte Carlo (DSMC)](https://en.wikipedia.org/wiki/Direct_simulation_Monte_Carlo),
  * and so on.
  
  I won't ask for the exact differences, but why are all of them called Monte Carlo? What do they all have in common? Can they all be used for AI? E.g. which one can be used for gaming (like Go) or image recognition (resampling)?
  
  **Tags:** gaming, comparison, monte-carlo-tree-search
  > **Comments:**
  > **username_1**: I found [this paper](http://www.cameronius.com/cv/mcts-survey-master.pdf) which looks pretty comprehensive, and they touch on Go on p.27. However, that part is outdated since [AlphaGo](https://gogameguru.com/i/2016/03/deepmind-mastering-go.pdf).  You might want to look at [Matthew Lai's Giraffe Chess](https://arxiv.org/pdf/1509.01549v2.pdf) paper. Similar method, but a less complex game.  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2016-08-23. Score: 7 | Accepted answer
  
  They are all called Monte Carlo because all of them are a different version of the canonical Monte Carlo algorithm.
  
  The canonical version of Monte Carlo algorithm is a stochastic algorithm to determine an action based in a tree representation. The differences among all these version are their exploration and exploitation mechanisms, and it is necessary to analyse each of them to define which one fits in your case.
  
  
  ---
  
  