Many psychologists like to use anagrams to illustrate algorithmic solutions. For example, if one is presented with the letters TEHAR, the algorithmic way to find an English word composed of those letters is to try every possible arrangement, such as TERAH, TERHA, TEARH, TEAHR, TEHRA, TEHAR (these exhaust the possibilities starting with TE) and continue until all possible combinations have been evaluated to determine whether any one forms a word in English. For a five-letter word, 120 combinations of letters are possible. If every anagram had to be solved in this manner, the problem solver might say, Have a HEART!