Science, asked by atharvaborawake95, 12 days ago

What is the minimum number of moves required to solve a Tower of Hanoi puzzle?​

Answers

Answered by Anonymous
1

Answer:

The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.

Answered by gayatri8752
0

Answer:

2^n-1

where n is the no. of disks

hope it helps u!

Similar questions