Nice one. Writing a program to solve this game was one of the assignments that they always gave made you do in one of the first year Computing Science classes where I went to university. For N discs, the fewest number of moves that you need to solve it is 2^N - 1.

Nice one. Writing a program to solve this game was one of the assignments that they always gave made you do in one of the first year Computing Science classes where I went to university. For N discs, the fewest number of moves that you need to solve it is 2^N - 1.

I never heard this game called this before, and the puzzle took me a long time, but very nice result!

I never heard this game called this before, and the puzzle took me a long time, but very nice result!