What is the minimum number of moves required to solve a Tower of Hanoi puzzle?
Answers
Answered by
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
0
Answer:
2^n-1
where n is the no. of disks
hope it helps u!
Similar questions
English,
6 days ago
Social Sciences,
6 days ago
Math,
6 days ago
Social Sciences,
12 days ago
Math,
12 days ago
Math,
7 months ago
Economy,
7 months ago
Science,
7 months ago