ABSTRACT
Many probability problems are incredibly cumber-some to solve analytically but can be approximated readily using computer simulations. Imagine, for instance, trying to compute the expected profit of one strategy versus another, the probability of a particular hand like A♠ K♥ winning a showdown against a full table of opponents with random hands, or the probability of a player making a full house or better and losing the hand, given that the players are all-in before they even see their cards.
