[Haskell-beginners] tower hanoi problem

Roelof Wobben r.wobben at home.nl
Sat Feb 14 21:27:27 UTC 2015


KC schreef op 14-2-2015 om 22:23:
>
> Hint:
>
> - think about what you need to do in each recursive step and in the 
> base case
>
> - there is also an interesting way of viewing the problem
>
>

Check if I can do another step or check if the end case all disk are on 
the last peg.

Im very curious what the interesting way is




More information about the Beginners mailing list