Rare card
Metropolis–Hastings algorithm
- Value
- 50 W
- Attack
- 247
- Defence
- 198
- Players
- 0
In statistics and statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.
Get Metropolis–Hastings algorithm in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack