Putting a question mark after the name of a game or puzzle does not make it a sensible question.
Chat with our AI personalities
im not sure but it could be double it plus one? if you find out can you please answer the question thanks The answer is (2^n) - 1 where n is the number of disks
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.
It normally opens at about 10am to 7pm...
1) Twin Towers 2)The Pentagon 3)World Trade Center
It would take 264 - 1 seconds or, at one move per second, approx 585 billion years.