  We investigate properties of random mappings whose core is composed of
derangements as opposed to permutations. Such mappings arise as the natural
framework to study the Screaming Toes game described, for example, by Peter
Cameron. This mapping differs from the classical case primarily in the
behaviour of the small components, and a number of explicit results are
provided to illustrate these differences.
