A man was in love with a young lady whose Christian name was Hannah.
When he asked her to be his wife she wrote down the letters of her name
in this manner:--
H H H H H H
H A A A A H
H A N N A H
H A N N A H
H A A A A H
H H H H H H
and promised that she would be his if he could tell her correctly in how
many different ways it was possible to spell out her name, always
passing from one letter to another that was adjacent. Diagonal steps are
here allowed. Whether she did this merely to tease him or to test his
cleverness is not recorded, but it is satisfactory to know that he
succeeded. Would you have been equally successful? Take your pencil and
try. You may start from any of the H's and go backwards or forwards and
in any direction, so long as all the letters in a spelling are adjoining
one another. How many ways are there, no two exactly alike?