# The Three-Tower Problem

The Three-Tower Problem

20

1.4803×

-16

10

20

(-2.96059×)

-16

10

21

1.4803×

-16

10

There are three piles of chips. Two piles are chosen at random and a chip is moved from the first choice to the second. This procedure is continued until one of the piles becomes empty. The Demonstration shows simulations of this process. You can see the probabilities of the duration of the process and read the expected value and variance of the duration.