answersLogoWhite

0


Best Answer

For any n-disc version of the Tower of Hanoi, the optimum solution for the puzzle takes a minimum of 2n-1 moves. In the case of 6, 7, 8-sized Towers of Hanoi, the puzzle would take: 26-1 = 63, 27-1 = 127, 28-1 = 255 moves.

User Avatar

Wiki User

13y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How long would it take to the hanoi puzzle with 6 7 8 discs?
Write your answer...
Submit
Still have questions?
magnify glass
imp