  We emphasize the dominance in the Monty Hall problem, both in the classical
scenario and its multi-door generalization. This is used to show optimality of
the class of always-switching strategies for nonuniform allocation of the prize
and arbitrary door-revealing mechanism in the event of match.
