  A number of tricky problems in probability are discussed, having in common
one or more infinite sequences of coin tosses, and a representation as a
problem in dependent percolation. Three of these problems are of `Winkler'
type, that is, they ask about what can be achieved by a clairvoyant demon.
