← Questions
Tower of Hanoi moves
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Print or return every move that transfers n disks from the first peg to the third, using the middle peg, never placing a larger disk on a smaller one. Write the recursive solution and explain why it takes 2^n - 1 moves.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding