The "matching" hats problem is a classic exercise in probability: if "n" people throw their hats in a box, and then each person randomly draws one out again, what is the expected number of people who draw their own hat? This paper presents several extensions to this problem, with solutions that involve interesting tricks with iterated expectations, the law of total probability, and binomial and hypergeometric distributions.