  In this paper we consider the palindromes that can be formed by taking
unordered sets of $n$ elements from an alphabet of $b$ letters. In particular,
we seek to find the probability that given a random member of this space we are
able to re-arrange its elements to form a palindrome. We conclude by exploring
the behaviour of this probability as $n, b \to \infty$
