A little Haskell to solve the towers of Hanoi problem and give a list of moves using a Writer monad. It explicitly calculates the number of moves while logging the moves that have been made. Simple recursive approach used.