added new problem: towers of hanoi generic

Class to solve the classic Towers of Hanoi problem, but generalized for
any number of discs and towers, computing the minimum number of moves
required and recording the move sequence that solved it. Unit tests is
not complete, included to show example of using the class.