Re: [Haskell-beginners] tower hanoi problem

On Feb 17, 2015 10:18 AM, "Roelof Wobben" wrote:

This part I understand well.

So you could do something like this:

hanoi n 1 2 3 | n = 0 -> moves the last disk to the goal peg | n != 0 -> moves all the other disk to the spare peg or to the moves

n -1 to the goal peg What does n represent here?